default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimo Cairo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Massimo Cairo
, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ACM Trans. Algorithms 20(1): 4:1-4:26 (2024)- [j10]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): 13 (2024) - 2023
- [c15]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: 17:1-17:17 - 2022
- [j9]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. Algorithmica 84(3): 719-741 (2022) - [j8]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): 3673-3684 (2022) - [c14]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: 31:1-31:14 - [c13]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: 359-376 - [i15]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 abs/2207.02136 (2022) - [i14]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut paths and their remainder structure, with applications. CoRR abs/2210.07530 (2022) - [i13]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - 2021
- [j7]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: 103-108 (2021) - [j6]Davide Morelli, Alessio Rossi, Leonardo Bartoloni, Massimo Cairo, David A. Clifton:
SDNN24 Estimation from Semi-Continuous HR Measures. Sensors 21(4): 1463 (2021) - [c12]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP 2021: 43:1-43:18 - [c11]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: 257-269 - [i12]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 abs/2104.10108 (2021) - [i11]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 abs/2107.05717 (2021) - 2020
- [j5]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. J. Log. Algebraic Methods Program. 113: 100542 (2020) - [i10]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 abs/2002.10498 (2020) - [i9]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 abs/2006.15024 (2020) - [i8]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. CoRR abs/2007.04726 (2020) - [i7]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 abs/2007.07575 (2020) - [i6]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 abs/2011.12635 (2020)
2010 – 2019
- 2019
- [j4]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): 3163 (2019) - [j3]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019) - [j2]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): 23-30 (2019) - [j1]Massimo Cairo, Romeo Rizzi:
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. Theor. Comput. Sci. 797: 2-16 (2019) - 2018
- [c10]Massimo Cairo, Luke Hunsberger, Romeo Rizzi:
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME 2018: 8:1-8:16 - 2017
- [c9]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM 2017: 29:1-29:12 - [c8]Massimo Cairo, Romeo Rizzi:
The Complexity of Simulation and Matrix Multiplication. SODA 2017: 2203-2214 - [c7]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability Made Simple. TIME 2017: 8:1-8:16 - [c6]Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri:
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME 2017: 9:1-9:18 - [c5]Massimo Cairo, Luke Hunsberger, Roberto Posenato, Romeo Rizzi:
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME 2017: 10:1-10:19 - 2016
- [c4]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI 2016: 1484-1490 - [c3]Massimo Cairo, Roberto Grossi, Romeo Rizzi:
New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA 2016: 363-376 - [c2]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME 2016: 80-89 - [c1]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. TIME 2016: 90-99 - [i5]Massimo Cairo, Romeo Rizzi:
The Complexity of Simulation and (Exotic) Matrix Multiplications. CoRR abs/1605.02156 (2016) - [i4]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. CoRR abs/1608.04132 (2016) - [i3]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete. CoRR abs/1608.08545 (2016) - [i2]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela:
Diploid Alignment is NP-hard. CoRR abs/1611.05086 (2016) - 2015
- [i1]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. CoRR abs/1512.00077 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
