Massimo Cairo

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 40

Top Topics

Interpolation Methods

Simple Temporal

Theoretical Framework

Top Venues

ACM Trans. Algorithms

Publications

Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
. ACM Trans. Algorithms 20 (1) (2024)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20 (2) (2024)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
Cut Paths and Their Remainder Structure, with Applications. STACS (2023)
Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19 (6) (2022)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. ESA (2022)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
Cut paths and their remainder structure, with applications. CoRR (2022)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
Safety in s-t Paths, Trails and Walks. Algorithmica 84 (3) (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA (2022)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. CoRR (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Minimum Path Cover in Parameterized Linear Time. CoRR (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG (2021)
Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP (2021)
Davide Morelli, Alessio Rossi, Leonardo Bartoloni, Massimo Cairo, David A. Clifton
SDNN24 Estimation from Semi-Continuous HR Measures. Sensors 21 (4) (2021)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. 305 (2021)
Nikola Dolezalova, Massimo Cairo, Alex Despotovic, Adam T. C. Booth, Angus B. Reed, Davide Morelli, David Plans
Development of a dynamic type 2 diabetes risk prediction tool: a UK Biobank study. CoRR (2021)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR (2021)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
Safety in s-t Paths, Trails and Walks. CoRR (2020)
Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. CoRR (2020)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR (2020)
Massimo Cairo, Carlo Comin, Romeo Rizzi
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. J. Log. Algebraic Methods Program. 113 (2020)
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
Computing all s-t bridges and articulation points simplified. CoRR (2020)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR (2020)
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15 (4) (2019)
Massimo Cairo, Romeo Rizzi
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. Theor. Comput. Sci. 797 (2019)
Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (1) (2019)
Davide Morelli, Alessio Rossi, Massimo Cairo, David A. Clifton
Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations. Sensors 19 (14) (2019)
Massimo Cairo, Luke Hunsberger, Romeo Rizzi
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME (2018)
Massimo Cairo, Romeo Rizzi
The Complexity of Simulation and Matrix Multiplication. SODA (2017)
Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME (2017)
Massimo Cairo, Romeo Rizzi
Dynamic Controllability Made Simple. TIME (2017)
Massimo Cairo, Luke Hunsberger, Roberto Posenato, Romeo Rizzi
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME (2017)
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM (2017)
Massimo Cairo, Carlo Comin, Romeo Rizzi
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. CoRR (2016)
Massimo Cairo, Roberto Grossi, Romeo Rizzi
New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA (2016)
Massimo Cairo, Carlo Comin, Romeo Rizzi
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME (2016)
Massimo Cairo, Romeo Rizzi
Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete. CoRR (2016)
Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela
Diploid Alignment is NP-hard. CoRR (2016)
Massimo Cairo, Gabriele Farina, Romeo Rizzi
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI (2016)
Massimo Cairo, Romeo Rizzi
The Complexity of Simulation and (Exotic) Matrix Multiplications. CoRR (2016)
Massimo Cairo, Romeo Rizzi
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. TIME (2016)
Massimo Cairo, Gabriele Farina, Romeo Rizzi
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. CoRR (2015)