Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. - Massimo Cairo; Gabriele Farina; Romeo Rizzi (AAAI, 2016)

New Bounds for Approximating Extremal Distances in Undirected Graphs. - Massimo Cairo; Roberto Grossi; Romeo Rizzi (SODA, 2016)

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. - Massimo Cairo; Romeo Rizzi (TIME, 2016)

The Complexity of Simulation and (Exotic) Matrix Multiplications. - Massimo Cairo; Romeo Rizzi (CoRR, 2016)

Diploid Alignment is NP-hard. - Romeo Rizzi; Massimo Cairo; Veli Mäkinen; Daniel Valenzuela 001 (CoRR, 2016)

Optimal Omnitig Listing for Safe and Complete Contig Assembly. - Massimo Cairo; Paul Medvedev; Nidia Obscura Acosta; Romeo Rizzi; Alexandru I. Tomescu (CPM, 2017)

The Complexity of Simulation and Matrix Multiplication. - Massimo Cairo; Romeo Rizzi (SODA, 2017)

Incorporating Decision Nodes into Conditional Simple Temporal Networks. - Massimo Cairo; Carlo Combi; Carlo Comin; Luke Hunsberger; Roberto Posenato; Romeo Rizzi; Matteo Zavatteri (TIME, 2017)

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. - Massimo Cairo; Luke Hunsberger; Roberto Posenato; Romeo Rizzi (TIME, 2017)

Dynamic Controllability Made Simple. - Massimo Cairo; Romeo Rizzi (TIME, 2017)

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. - Massimo Cairo; Luke Hunsberger; Romeo Rizzi (TIME, 2018)

Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations. - Davide Morelli; Alessio Rossi; Massimo Cairo; David A. Clifton (Sensors, 2019)

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. - Massimo Cairo; Paul Medvedev; Nidia Obscura Acosta; Romeo Rizzi; Alexandru I. Tomescu (ACM Trans. Algorithms, 2019)

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. - Romeo Rizzi; Massimo Cairo; Veli Mäkinen; Alexandru I. Tomescu; Daniel Valenzuela 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. - Massimo Cairo; Romeo Rizzi (Theor. Comput. Sci., 2019)

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)

On the parameterized complexity of the Minimum Path Cover problem in DAGs. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (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)

Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. - Massimo Cairo; Carlo Comin; Romeo Rizzi (J. Log. Algebraic Methods Program., 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 Linear-Time Parameterized Algorithm for Computing the Width of a DAG. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (WG, 2021)

Development of a dynamic type 2 diabetes risk prediction tool: a UK Biobank study. - Nikola Dolezalova; Massimo Cairo; Alex Despotovic; Adam T. C. Booth; Angus B. Reed; Davide Morelli; David Plans (CoRR, 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)

SDNN24 Estimation from Semi-Continuous HR Measures. - Davide Morelli; Alessio Rossi; Leonardo Bartoloni; Massimo Cairo; David A. Clifton (Sensors, 2021)

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (SODA, 2022)

Safety in s-t Paths, Trails and Walks. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu (Algorithmica, 2022)

Minimum Path Cover in Parameterized Linear Time. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2022)

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. - Manuel Cáceres; Brendan Mumey; Edin Husic; Romeo Rizzi; Massimo Cairo; Kristoffer Sahlin; Alexandru I. Tomescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

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)

Width Helps and Hinders Splitting Flows. - Manuel Cáceres; Massimo Cairo; Andreas Grigorjew; Shahbaz Khan 004; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu; Lucia Williams (ACM Trans. Algorithms, 2024)