Online Algorithms on Antipowers and Antiperiods. - Mai Alzamel; Alessio Conte; Daniele Greco; Veronica Guerrini; Costas S. Iliopoulos; Nadia Pisanti; Nicola Prezza; Giulia Punzi; Giovanna Rosone (SPIRE, 2019)

Polynomial-Delay Enumeration of Maximal Common Subsequences. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (SPIRE, 2019)

Hide and Mine in Strings: Hardness and Algorithms. - Giulia Bernardini 001; Alessio Conte; Garance Gourdel; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi; Leen Stougie; Michelle Sweering (ICDM, 2020)

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. - Alessio Conte; Pierluigi Crescenzi; Andrea Marino 001; Giulia Punzi (MFCS, 2020)

Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. - Alessio Conte; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi (FCT, 2021)

Bounding the Number of Eulerian Tours in Undirected Graphs. - Giulia Punzi (COCOON, 2022)

On Strings Having the Same Length- k Substrings. - Giulia Bernardini 001; Alessio Conte; Estéban Gabory; Roberto Grossi; Grigorios Loukides; Solon P. Pissis; Giulia Punzi; Michelle Sweering (CPM, 2022)

Enumeration of Maximal Common Subsequences Between Two Strings. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (Algorithmica, 2022)

A Compact DAG for Storing and Searching Maximal Common Subsequences. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (ISAAC, 2023)

An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. - Giulia Punzi; Alessio Conte; Roberto Grossi; Andrea Marino 001 (SDM, 2023)

Hide and Mine in Strings: Hardness, Algorithms, and Experiments. - Giulia Bernardini 001; Alessio Conte; Garance Gourdel; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi; Leen Stougie; Michelle Sweering (IEEE Trans. Knowl. Data Eng., 2023)

Finding Diverse Strings and Longest Common Subsequences in a Graph. - Yuto Shida; Giulia Punzi; Yasuaki Kobayashi; Takeaki Uno; Hiroki Arimura (CPM, 2024)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. - Caroline Brosse; Alessio Conte; Vincent Limouzy; Giulia Punzi; Davide Rucci (IWOCA, 2024)

McDag: Indexing Maximal Common Subsequences in Practice. - Giovanni Buzzega; Alessio Conte; Roberto Grossi; Giulia Punzi (WABI, 2024)

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. - Giulia Punzi; Alessio Conte; Roberto Grossi; Romeo Rizzi (Algorithmica, 2024)

Subsequence-Based Indices for Genome Sequence Analysis. - Giovanni Buzzega; Alessio Conte; Veronica Guerrini; Giulia Punzi; Giovanna Rosone; Lorenzo Tattini (From Strings to Graphs, and Back Again, 2025)

Designing Output Sensitive Algorithms for Subgraph Enumeration. - Alessio Conte; Kazuhiro Kurita; Andrea Marino 001; Giulia Punzi; Takeaki Uno; Kunihiro Wasa (From Strings to Graphs, and Back Again, 2025)

The Complexity of Maximal Common Subsequence Enumeration. - Giovanni Buzzega; Alessio Conte; Yasuaki Kobayashi; Kazuhiro Kurita; Giulia Punzi (Proc. ACM Manag. Data, 2025)

Are Depth-2 Regular Expressions Hard to Intersect? - Rocco Ascone; Giulia Bernardini 001; Alessio Conte; Veronica Guerrini; Giulia Punzi (CoRR, 2025)

sc McDag: indexing maximal common subsequences for k strings. - Giovanni Buzzega; Alessio Conte; Roberto Grossi; Giulia Punzi (Algorithms Mol. Biol., 2025)