From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Computing all s-t bridges and articulation points simplified. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (ICALP, 2021)

A simplified algorithm computing all s-t bridges and articulation points. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (Discret. Appl. Math., 2021)

Cut Paths and Their Remainder Structure, with Applications. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (STACS, 2023)

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (ACM Trans. Algorithms, 2024)