Presentations of constrained systems with unconstrained positions. - Marie-Pierre Béal; Maxime Crochemore; Gabriele Fici (IEEE Trans. Inf. Theory, 2005)

Word assembly through minimal forbidden words. - Gabriele Fici; Filippo Mignosi; Antonio Restivo; Marinella Sciortino (Theor. Comput. Sci., 2006)

Minimal Forbidden Words and Applications. (Mots interdits minimaux et applications). - Gabriele Fici (2006)

Marked Systems and Circular Splicing. - Clelia de Felice; Gabriele Fici; Rosalba Zizza (FCT, 2007)

Combinatorics of Finite Words and Suffix Automata. - Gabriele Fici (CAI, 2009)

Searching for Jumbled Patterns in Strings. - Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Stringology, 2009)

A characterization of regular circular languages generated by marked splicing systems. - Clelia de Felice; Gabriele Fici; Rosalba Zizza (Theor. Comput. Sci., 2009)

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (FUN, 2010)

On the Minimal Uncompletable Word Problem - Gabriele Fici; Elena V. Pribavkina; Jacques Sakarovitch (CoRR, 2010)

On the regularity of circular splicing languages: a survey and new developments. - Paola Bonizzoni; Clelia de Felice; Gabriele Fici; Rosalba Zizza (Nat. Comput., 2010)

On Prefix Normal Words. - Gabriele Fici; Zsuzsanna Lipták (Developments in Language Theory, 2011)

Computing Abelian Periods in Words. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Stringology, 2011)

A Classification of Trapezoidal Words - Gabriele Fici (WORDS, 2011)

Special factors and the combinatorics of suffix and factor automata. - Gabriele Fici (Theor. Comput. Sci., 2011)

A Characterization of Bispecial Sturmian Words. - Gabriele Fici (MFCS, 2012)

Quasi-linear Time Computation of the Abelian Periods of a Word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Stringology, 2012)

Vertical representation of C{ infty}-words - Jean-Marc Fedou; Gabriele Fici (CoRR, 2012)

Binary Jumbled String Matching: Faster Indexing in Less Space - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (CoRR, 2012)

Topological properties of cellular automata on trees - Gabriele Fici; Francesca Fiorenzi (AUTOMATA & JAC, 2012)

Algorithms for Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Int. J. Found. Comput. Sci., 2012)

On Approximate Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Theory Comput. Syst., 2012)

Automata and differentiable words. - Jean-Marc Fedou; Gabriele Fici (Theor. Comput. Sci., 2012)

Open and Closed Prefixes of Sturmian Words. - Alessandro De Luca 002; Gabriele Fici (WORDS, 2013)

Abelian Repetitions in Sturmian Words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Élise Prieur-Gaston (Developments in Language Theory, 2013)

A Note on Words With the Smallest Number of Closed Factors - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (CoRR, 2013)

Binary jumbled string matching for highly run-length compressible texts. - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (Inf. Process. Lett., 2013)

Enumeration and structure of trapezoidal words. - Michelangelo Bucci; Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2013)

On the least number of palindromes contained in an infinite word. - Gabriele Fici; Luca Q. Zamboni (Theor. Comput. Sci., 2013)

Splicing Systems from Past to Future: Old and New Challenges. - Luc Boasson; Paola Bonizzoni; Clelia De Felice; Isabelle Fagnot; Gabriele Fici; Rocco Zaccagnino; Rosalba Zizza (Discrete Mathematics and Computer Science, 2014)

On Combinatorial Generation of Prefix Normal Words. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (CPM, 2014)

Normal, Abby Normal, Prefix Normal. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (FUN, 2014)

Universal Lyndon Words. - Arturo Carpi; Gabriele Fici; Stepan Holub; Jakub Oprsal; Marinella Sciortino (MFCS (1), 2014)

Algorithms for computing Abelian periods of words. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Discret. Appl. Math., 2014)

On the structure of bispecial Sturmian words. - Gabriele Fici (J. Comput. Syst. Sci., 2014)

A subquadratic algorithm for minimum palindromic factorization. - Gabriele Fici; Travis Gagie; Juha Kärkkäinen; Dominik Kempa (J. Discrete Algorithms, 2014)

Words with the Maximum Number of Abelian Squares. - Gabriele Fici; Filippo Mignosi (WORDS, 2015)

On the Number of Closed Factors in a Word. - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (LATA, 2015)

Online Computation of Abelian Runs. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (LATA, 2015)

Abelian Powers and Repetitions in Sturmian Words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Élise Prieur-Gaston (CoRR, 2015)

Factorizations of the Fibonacci Infinite Word. - Gabriele Fici (J. Integer Seq., 2015)

Vertical representation of C∞-words. - Jean-Marc Fedou; Gabriele Fici (Theor. Comput. Sci., 2015)

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. - Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (LATIN, 2016)

A note on easy and efficient computation of full abelian periods of a word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Discret. Appl. Math., 2016)

On the greedy algorithm for the Shortest Common Superstring problem with reversals. - Gabriele Fici; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Process. Lett., 2016)

Fast computation of abelian runs. - Gabriele Fici; Tomasz Kociumaka; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

Abelian powers and repetitions in Sturmian words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Jarkko Peltomäki; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

The sequence of open and closed prefixes of a Sturmian word. - Alessandro De Luca 002; Gabriele Fici; Luca Q. Zamboni (Adv. Appl. Math., 2017)

Open and ClosedWords. - Gabriele Fici (Bull. EATCS, 2017)

Cyclic complexity of words. - Julien Cassaigne; Gabriele Fici; Marinella Sciortino; Luca Q. Zamboni (J. Comb. Theory A, 2017)

On prefix normal words and prefix normal forms. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (Theor. Comput. Sci., 2017)

Abelian-square-rich words. - Gabriele Fici; Filippo Mignosi; Jeffrey O. Shallit (Theor. Comput. Sci., 2017)

On k-Maximal Submonoids, with Applications in Combinatorics on Words. - Giuseppa Castiglione; Gabriele Fici; Antonio Restivo (CoRR, 2018)

Abelian Anti-Powers in Infinite Words. - Gabriele Fici; Mickaël Postic; Manuel Silva 003 (CoRR, 2018)

Alignment-free sequence comparison using absent words. - Panagiotis Charalampopoulos; Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (Inf. Comput., 2018)

Algorithms for anti-powers in strings. - Golnaz Badkobeh; Gabriele Fici; Simon J. Puglisi (Inf. Process. Lett., 2018)

Anti-powers in infinite words. - Gabriele Fici; Antonio Restivo; Manuel Silva 003; Luca Q. Zamboni (J. Comb. Theory A, 2018)

On Sets of Words of Rank Two. - Giuseppa Castiglione; Gabriele Fici; Antonio Restivo (WORDS, 2019)

Constructing Antidictionaries in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (DCC, 2019)

Minimal Absent Words in Rooted and Unrooted Trees. - Gabriele Fici; Pawel Gawrychowski (SPIRE, 2019)

Abelian antipowers in infinite words. - Gabriele Fici; Mickaël Postic; Manuel Silva 003 (Adv. Appl. Math., 2019)

Aldo de Luca (1941 - 2018). - Clelia De Felice; Gabriele Fici; Antonio Restivo (Bull. EATCS, 2019)

Minimal forbidden factors of circular words. - Gabriele Fici; Antonio Restivo; Laura Rizzo (Theor. Comput. Sci., 2019)

Reverse-Safe Data Structures for Text Indexing. - Giulia Bernardini 001; Huiping Chen; Gabriele Fici; Grigorios Loukides; Solon P. Pissis (ALENEX, 2020)

Substring Query Complexity of String Reconstruction. - Gabriele Fici; Nicola Prezza; Rossano Venturini (CoRR, 2020)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. - Péter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Rajeev Raman; Joe Sawada (Theor. Comput. Sci., 2020)

Preface. - Gabriele Fici; Giuseppe F. Italiano (Theor. Comput. Sci., 2020)

Reverse-Safe Text Indexing. - Giulia Bernardini 001; Huiping Chen; Gabriele Fici; Grigorios Loukides; Solon P. Pissis (ACM J. Exp. Algorithmics, 2021)

Constructing Antidictionaries of Long Texts in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (Theory Comput. Syst., 2021)

Primitive sets of words. - Giuseppa Castiglione; Gabriele Fici; Antonio Restivo (Theor. Comput. Sci., 2021)

Adaptive learning of compressible strings. - Gabriele Fici; Nicola Prezza; Rossano Venturini (Theor. Comput. Sci., 2021)

Maximal Closed Substrings. - Golnaz Badkobeh; Alessandro De Luca 002; Gabriele Fici; Simon J. Puglisi (SPIRE, 2022)

Properties of a class of Toeplitz words. - Gabriele Fici; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

On the Lie complexity of Sturmian words. - Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2022)

On the Impact of Morphisms on BWT-Runs. - Gabriele Fici; Giuseppe Romana; Marinella Sciortino; Cristian Urbina (CPM, 2023)

Substring Complexity in Sublinear Space. - Giulia Bernardini 001; Gabriele Fici; Pawel Gawrychowski; Solon P. Pissis (ISAAC, 2023)

Abelian combinatorics on words: A survey. - Gabriele Fici; Svetlana Puzynina (Comput. Sci. Rev., 2023)

Some Remarks on Palindromic Periodicities. - Gabriele Fici; Jeffrey O. Shallit; Jamie Simpson (CoRR, 2024)

The Shortest Interesting Binary Words. - Gabriele Fici (CoRR, 2024)

Some results on digital segments and balanced words. - Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2024)

BWT and Combinatorics on Words. - Gabriele Fici; Sabrina Mantaci; Antonio Restivo; Giuseppe Romana; Giovanna Rosone; Marinella Sciortino (The Expanding World of Compressed Data, 2025)

On Palindromic Periodicities. - Gabriele Fici; Jeffrey O. Shallit; Jamie Simpson (CPM, 2025)

Digital Convexity and Combinatorics on Words. - Alessandro De Luca 002; Gabriele Fici; Andrea Frosini (WORDS, 2025)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform. - Gabriele Fici; Estéban Gabory (MFCS, 2025)

Morphisms and BWT-Run Sensitivity. - Gabriele Fici; Giuseppe Romana; Marinella Sciortino; Cristian Urbina (MFCS, 2025)

U-Index: A Universal Indexing Framework for Matching Long Patterns. - Lorraine A. K. Ayad; Gabriele Fici; Ragnar Groot Koerkamp; Grigorios Loukides; Rob Patro; Giulio Ermanno Pibiri; Solon P. Pissis (SEA, 2025)

String Consensus Problems with Swaps and Substitutions. - Estéban Gabory; Laurent Bulteau; Gabriele Fici; Hilde Verbeek 001 (CoRR, 2025)