On a conjecture on bidimensional words. - Chiara Epifanio; Michel Koskas; Filippo Mignosi (Theor. Comput. Sci., 2003)

A Trie-Based Approach for Compacting Automata. - Maxime Crochemore; Chiara Epifanio; Roberto Grossi; Filippo Mignosi (CPM, 2004)

Sturmian Graphs and a Conjecture of Moser. - Chiara Epifanio; Filippo Mignosi; Jeffrey O. Shallit; Ilaria Venturini (Developments in Language Theory, 2004)

Languages with Mismatches and an Application to Approximate Indexing. - Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi (Developments in Language Theory, 2005)

A multidimensional critical factorization theorem. - Chiara Epifanio; Filippo Mignosi (Theor. Comput. Sci., 2005)

On the Suffix Automaton with Mismatches. - Maxime Crochemore; Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi (CIAA, 2007)

On Sturmian graphs. - Chiara Epifanio; Filippo Mignosi; Jeffrey O. Shallit; Ilaria Venturini (Discret. Appl. Math., 2007)

Languages with mismatches. - Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi; Antonio Restivo; Marinella Sciortino (Theor. Comput. Sci., 2007)

From Nerode's congruence to suffix automata with mismatches. - Maxime Crochemore; Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi (Theor. Comput. Sci., 2009)

On Lazy Representations and Sturmian Graphs. - Chiara Epifanio; Christiane Frougny; Alessandra Gabriele; Filippo Mignosi; Jeffrey O. Shallit (CIAA, 2010)

Sturmian graphs and integer representations over numeration systems. - Chiara Epifanio; Christiane Frougny; Alessandra Gabriele; Filippo Mignosi; Jeffrey O. Shallit (Discret. Appl. Math., 2012)

Linear-size suffix tries. - Maxime Crochemore; Chiara Epifanio; Roberto Grossi; Filippo Mignosi (Theor. Comput. Sci., 2016)

On the k-Hamming and k-Edit Distances. - Chiara Epifanio; Luca Forlizzi; Francesca Marzi; Filippo Mignosi; Giuseppe Placidi; Matteo Spezialetti (ICTCS, 2023)