Massimo Cairo

Orcid: 0000-0001-7247-756X

According to our database¹, Massimo Cairo authored at least 32 papers between 2016 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

2016

2017

2018

2019

2020

2021

2022

2023

2024

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Width Helps and Hinders Splitting Flows.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2024

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2024

2023

Cut Paths and Their Remainder Structure, with Applications.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

CoRR, 2022

Safety in s-t Paths, Trails and Walks.

[BibT_eX]

[DOI]

Algorithmica, 2022

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

SDNN24 Estimation from Semi-Continuous HR Measures.

[BibT_eX]

[DOI]

Sensors, 2021

A simplified algorithm computing all s-t bridges and articulation points.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Development of a dynamic type 2 diabetes risk prediction tool: a UK Biobank study.

[BibT_eX]

[DOI]

CoRR, 2021

A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks.

[BibT_eX]

[DOI]

Massimo Cairo

Carlo Comin

Romeo Rizzi

J. Log. Algebraic Methods Program., 2020

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms.

[BibT_eX]

[DOI]

CoRR, 2020

On the parameterized complexity of the Minimum Path Cover problem in DAGs.

[BibT_eX]

[DOI]

CoRR, 2020

Computing all s-t bridges and articulation points simplified.

[BibT_eX]

[DOI]

CoRR, 2020

From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution.

[BibT_eX]

[DOI]

Massimo Cairo

Romeo Rizzi

Theor. Comput. Sci., 2019

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations.

[BibT_eX]

[DOI]

Sensors, 2019

2018

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty.

[BibT_eX]

[DOI]

Massimo Cairo

Luke Hunsberger

Romeo Rizzi

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

2017

Dynamic Controllability Made Simple.

[BibT_eX]

[DOI]

Massimo Cairo

Romeo Rizzi

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Incorporating Decision Nodes into Conditional Simple Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

The Complexity of Simulation and Matrix Multiplication.

[BibT_eX]

[DOI]

Massimo Cairo

Romeo Rizzi

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimal Omnitig Listing for Safe and Complete Contig Assembly.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Diploid Alignment is NP-hard.

[BibT_eX]

[DOI]

CoRR, 2016

The Complexity of Simulation and (Exotic) Matrix Multiplications.

[BibT_eX]

[DOI]

Massimo Cairo

Romeo Rizzi

CoRR, 2016

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete.

[BibT_eX]

[DOI]

Massimo Cairo

Romeo Rizzi

Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

New Bounds for Approximating Extremal Distances in Undirected Graphs.

[BibT_eX]

[DOI]

Massimo Cairo

Roberto Grossi

Romeo Rizzi

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication.

[BibT_eX]

[DOI]

Massimo Cairo

Gabriele Farina

Romeo Rizzi

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Massimo Cairo

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...