On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. - Massimo Equi; Roberto Grossi; Veli Mäkinen (CoRR, 2019)

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. - Massimo Equi; Roberto Grossi; Alexandru I. Tomescu; Veli Mäkinen (CoRR, 2019)

Linear Time Construction of Indexable Founder Block Graphs. - Veli Mäkinen; Bastien Cazaux; Massimo Equi; Tuukka Norri; Alexandru I. Tomescu (WABI, 2020)

Conditional Indexing Lower Bounds Through Self-Reducibility. - Massimo Equi; Veli Mäkinen; Alexandru I. Tomescu (CoRR, 2020)

Algorithms and Complexity on Indexing Elastic Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (ISAAC, 2021)

From Bit-Parallelism to Quantum String Matching for Labelled Graphs. - Massimo Equi; Arianne Meijer-van de Griend; Veli Mäkinen (CPM, 2023)

Algorithms and Complexity on Indexing Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (Algorithmica, 2023)

On the Complexity of String Matching for Graphs. - Massimo Equi; Veli Mäkinen; Alexandru I. Tomescu; Roberto Grossi (ACM Trans. Algorithms, 2023)

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. - Massimo Equi; Veli Mäkinen; Alexandru I. Tomescu (Theor. Comput. Sci., 2023)

A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. - Rocco Ascone; Giulia Bernardini 001; Alessio Conte; Massimo Equi; Estéban Gabory; Roberto Grossi; Nadia Pisanti (WABI, 2024)

Elastic founder graphs improved and enhanced. - Nicola Rizzo 001; Massimo Equi; Tuukka Norri; Veli Mäkinen (Theor. Comput. Sci., 2024)

Graph Indexing Beyond Wheeler Graphs. - Jarno N. Alanko; Elena Biagi 002; Massimo Equi; Veli Mäkinen; Simon J. Puglisi; Nicola Rizzo 001; Kunihiko Sadakane; Jouni Sirén (The Expanding World of Compressed Data, 2025)

Conditional Lower Bounds for String Matching in Labelled Graphs. - Massimo Equi (From Strings to Graphs, and Back Again, 2025)

Distributed Quantum Advantage for Local Problems. - Alkida Balliu; Sebastian Brandt 002; Xavier Coiteux-Roy; Francesco D'Amore 001; Massimo Equi; François Le Gall; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Marc-Olivier Renou; Jukka Suomela; Lucas Tendick; et al. (STOC, 2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems. - Alkida Balliu; Filippo Casagrande; Francesco D'Amore 001; Massimo Equi; Barbara Keller; Henrik Lievonen; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. - Alkida Balliu; Corinna Coupette; Antonio Cruciani; Francesco D'Amore 001; Massimo Equi; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Jukka Suomela (CoRR, 2025)