default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiusi Castiglione
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Sets of Words and Generalizations of the Fibonacci Cubes. CiE 2024: 447-460- [c17]Giuseppa Castiglione, Sabrina Mantaci, Salvatore Leonardo Pizzuto, Antonio Restivo:
A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach. ICTCS 2024: 95-105 - [c16]Giuseppa Castiglione, Antonio Restivo:
Completing Wheeler Automata. ICTCS 2024: 120-132 - [i7]Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Characterization of Isometric Words based on Swap and Mismatch Distance. CoRR abs/2404.13577 (2024) - 2023
- [c15]Giuseppa Castiglione, Manuela Flores
, Dora Giammarresi:
Isometric Words and Edit Distance: Main Notions and New Variations. AUTOMATA 2023: 3-16 - [c14]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Hypercubes and Isometric Words Based on Swap and Mismatch Distance. DCFS 2023: 21-35 - [c13]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Words Based on Swap and Mismatch Distance. DLT 2023: 23-35 - [e1]Giuseppa Castiglione, Marinella Sciortino:
Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023. CEUR Workshop Proceedings 3587, CEUR-WS.org 2023 [contents] - [i6]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Words based on Swap and Mismatch Distance. CoRR abs/2303.03086 (2023) - [i5]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Hypercubes and Isometric Words based on Swap and Mismatch Distance. CoRR abs/2303.09898 (2023) - 2022
- [j19]Giuseppa Castiglione, Stepan Holub:
The intersection of 3-maximal submonoids. Theor. Comput. Sci. 901: 35-44 (2022) - 2021
- [j18]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
Primitive sets of words. Theor. Comput. Sci. 866: 25-36 (2021) - [i4]Giuseppa Castiglione, Jia Gao, Sabrina Mantaci, Antonio Restivo:
A new distance based on minimal absent words and applications to biological sequences. CoRR abs/2105.14990 (2021) - 2020
- [j17]Giuseppa Castiglione, Sabrina Mantaci, Antonio Restivo:
Some Investigations on Similarity Measures Based on Absent Words. Fundam. Informaticae 171(1-4): 97-112 (2020) - [i3]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
Primitive Sets of Words. CoRR abs/2005.10668 (2020) - [i2]Giuseppa Castiglione, Stepan Holub:
The Intersection of 3-Maximal Submonids. CoRR abs/2008.01824 (2020)
2010 – 2019
- 2019
- [c12]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
On Sets of Words of Rank Two. WORDS 2019: 46-59 - 2018
- [i1]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
On k-Maximal Submonoids, with Applications in Combinatorics on Words. CoRR abs/1810.02182 (2018) - 2017
- [j16]Giusi Castiglione, Paolo Massazza:
On a class of languages with holonomic generating functions. Theor. Comput. Sci. 658: 74-84 (2017) - [j15]Stefano Brocchi, Giusi Castiglione, Paolo Massazza:
On the exhaustive generation of k-convex polyominoes. Theor. Comput. Sci. 664: 54-66 (2017) - 2015
- [j14]Stefano Brocchi, Giuseppa Castiglione, Paolo Massazza:
On Computing the Degree of Convexity of Polyominoes. Electron. J. Comb. 22(1): 1 (2015) - [j13]Giusi Castiglione, Marinella Sciortino:
Standard Sturmian words and automata minimization algorithms. Theor. Comput. Sci. 601: 58-66 (2015) - 2014
- [j12]Giusi Castiglione, Marinella Sciortino:
Epichristoffel Words and Minimization of Moore Automata. Fundam. Informaticae 134(3-4): 319-333 (2014) - [c11]Giusi Castiglione, Paolo Massazza:
An Efficient Algorithm for the Generation of Z-Convex Polyominoes. IWCIA 2014: 51-61 - 2013
- [c10]Giusi Castiglione, Marinella Sciortino:
Words, Trees and Automata Minimization. WORDS 2013: 18-33 - 2012
- [j11]Giusi Castiglione, Antonio Restivo:
On the Shuffle of Star-Free Languages. Fundam. Informaticae 116(1-4): 35-44 (2012) - [j10]Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino:
Nondeterministic Moore automata and Brzozowski's minimization algorithm. Theor. Comput. Sci. 450: 81-91 (2012) - 2011
- [j9]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's algorithm and tree-like automata. RAIRO Theor. Informatics Appl. 45(1): 59-75 (2011) - [c9]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Nondeterministic Moore Automata and Brzozowski's Algorithm. CIAA 2011: 88-99 - 2010
- [j8]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
On extremal cases of Hopcroft's algorithm. Theor. Comput. Sci. 411(38-39): 3414-3422 (2010) - [c8]Giusi Castiglione, Cyril Nicaud, Marinella Sciortino:
A Challenging Family of Automata for Classical Minimization Algorithms. CIAA 2010: 251-260
2000 – 2009
- 2009
- [j7]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Circular sturmian words and Hopcroft's algorithm. Theor. Comput. Sci. 410(43): 4372-4381 (2009) - [c7]Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Tree-like Automata. ICTCS 2009: 75-81 - [c6]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
On Extremal Cases of Hopcroft's Algorithm. CIAA 2009: 14-23 - 2008
- [c5]Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Cyclic Automata. LATA 2008: 172-183 - 2007
- [j6]Giusi Castiglione, Andrea Frosini, Emanuele Munarini, Antonio Restivo, Simone Rinaldi:
Combinatorial aspects of L-convex polyominoes. Eur. J. Comb. 28(6): 1724-1741 (2007) - [c4]Giusi Castiglione, Antonio Restivo:
L-Convex Polyominoes: A Survey. Formal Models, Languages and Applications 2007: 17-33 - [c3]Giusi Castiglione, Roberto Vaglica:
Recognizable Picture Languages and Polyominoes. CAI 2007: 160-171 - 2006
- [j5]Fabio Burderi, Giuseppa Castiglione, Antonio Restivo:
Higman's Theorem on Discrete Sets. Fundam. Informaticae 74(4): 435-446 (2006) - [j4]Giusi Castiglione, Antonio Restivo, Roberto Vaglica:
A reconstruction algorithm for L-convex polyominoes. Theor. Comput. Sci. 356(1-2): 58-72 (2006) - 2005
- [j3]Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
Enumeration of L-convex polyominoes by rows and columns. Theor. Comput. Sci. 347(1-2): 336-352 (2005) - [c2]Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
A Tomographical Characterization of L-Convex Polyominoes. DGCI 2005: 115-125 - 2004
- [j2]Giusi Castiglione, Antonio Restivo, Sergio Salemi:
Patterns in words and languages. Discret. Appl. Math. 144(3): 237-246 (2004) - [c1]Giusi Castiglione, Antonio Restivo:
Ordering and Convex Polyominoes. MCU 2004: 128-139 - 2003
- [j1]Giusi Castiglione, Antonio Restivo:
Reconstruction of L-convex Polyominoes. Electron. Notes Discret. Math. 12: 290-301 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
