Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Massimo Cairo
@article{DBLP:journals/talg/CairoRTZ24, author = {Massimo Cairo and Romeo Rizzi and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {Genome Assembly, from Practice to Theory: Safe, Complete and \emph{Linear-Time}}, journal = {{ACM} Trans. Algorithms}, volume = {20}, number = {1}, pages = {4:1--4:26}, year = {2024}, url = {https://doi.org/10.1145/3632176}, doi = {10.1145/3632176}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/CairoRTZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Cairo0RSTZ23, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu and Elia C. Zirondelli}, editor = {Petra Berenbrink and Patricia Bouyer and Anuj Dawar and Mamadou Moustapha Kant{\'{e}}}, title = {Cut Paths and Their Remainder Structure, with Applications}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2023, March 7-9, 2023, Hamburg, Germany}, series = {LIPIcs}, volume = {254}, pages = {17:1--17:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.STACS.2023.17}, doi = {10.4230/LIPICS.STACS.2023.17}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Cairo0RSTZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CairoKRST22, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu}, title = {Safety in s-t Paths, Trails and Walks}, journal = {Algorithmica}, volume = {84}, number = {3}, pages = {719--741}, year = {2022}, url = {https://doi.org/10.1007/s00453-021-00877-w}, doi = {10.1007/S00453-021-00877-W}, timestamp = {Fri, 13 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CairoKRST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/CaceresMHRCST22, author = {Manuel C{\'{a}}ceres and Brendan Mumey and Edin Husic and Romeo Rizzi and Massimo Cairo and Kristoffer Sahlin and Alexandru I. Tomescu}, title = {Safety in Multi-Assembly via Paths Appearing in All Path Covers of a {DAG}}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {19}, number = {6}, pages = {3673--3684}, year = {2022}, url = {https://doi.org/10.1109/TCBB.2021.3131203}, doi = {10.1109/TCBB.2021.3131203}, timestamp = {Thu, 27 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/CaceresMHRCST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/CaceresCG0MRTW22, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Andreas Grigorjew and Shahbaz Khan and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu and Lucia Williams}, editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman}, title = {Width Helps and Hinders Splitting Flows}, booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, series = {LIPIcs}, volume = {244}, pages = {31:1--31:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ESA.2022.31}, doi = {10.4230/LIPICS.ESA.2022.31}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/esa/CaceresCG0MRTW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CaceresCMRT22, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {359--376}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.18}, doi = {10.1137/1.9781611977073.18}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/CaceresCMRT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-02136, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Andreas Grigorjew and Shahbaz Khan and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu and Lucia Williams}, title = {Width Helps and Hinders Splitting Flows}, journal = {CoRR}, volume = {abs/2207.02136}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.02136}, doi = {10.48550/ARXIV.2207.02136}, eprinttype = {arXiv}, eprint = {2207.02136}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-02136.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-07530, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {Cut paths and their remainder structure, with applications}, journal = {CoRR}, volume = {abs/2210.07530}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.07530}, doi = {10.48550/ARXIV.2210.07530}, eprinttype = {arXiv}, eprint = {2210.07530}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-07530.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-09659, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, title = {Minimum Path Cover in Parameterized Linear Time}, journal = {CoRR}, volume = {abs/2211.09659}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.09659}, doi = {10.48550/ARXIV.2211.09659}, eprinttype = {arXiv}, eprint = {2211.09659}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-09659.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CairoKRSTZ21, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {A simplified algorithm computing all s-t bridges and articulation points}, journal = {Discret. Appl. Math.}, volume = {305}, pages = {103--108}, year = {2021}, url = {https://doi.org/10.1016/j.dam.2021.08.026}, doi = {10.1016/J.DAM.2021.08.026}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CairoKRSTZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sensors/MorelliRBCC21, author = {Davide Morelli and Alessio Rossi and Leonardo Bartoloni and Massimo Cairo and David A. Clifton}, title = {{SDNN24} Estimation from Semi-Continuous {HR} Measures}, journal = {Sensors}, volume = {21}, number = {4}, pages = {1463}, year = {2021}, url = {https://doi.org/10.3390/s21041463}, doi = {10.3390/S21041463}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sensors/MorelliRBCC21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CairoRTZ21, author = {Massimo Cairo and Romeo Rizzi and Alexandru I. Tomescu and Elia C. Zirondelli}, editor = {Nikhil Bansal and Emanuela Merelli and James Worrell}, title = {Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time}, booktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)}, series = {LIPIcs}, volume = {198}, pages = {43:1--43:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.43}, doi = {10.4230/LIPICS.ICALP.2021.43}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CairoRTZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaceresCMRT21, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {A Linear-Time Parameterized Algorithm for Computing the Width of a {DAG}}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {257--269}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_20}, doi = {10.1007/978-3-030-86838-3\_20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaceresCMRT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2104-10108, author = {Nikola Dolezalova and Massimo Cairo and Alex Despotovic and Adam T. C. Booth and Angus B. Reed and Davide Morelli and David Plans}, title = {Development of a dynamic type 2 diabetes risk prediction tool: a {UK} Biobank study}, journal = {CoRR}, volume = {abs/2104.10108}, year = {2021}, url = {https://arxiv.org/abs/2104.10108}, eprinttype = {arXiv}, eprint = {2104.10108}, timestamp = {Mon, 26 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2104-10108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-05717, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, title = {Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time}, journal = {CoRR}, volume = {abs/2107.05717}, year = {2021}, url = {https://arxiv.org/abs/2107.05717}, eprinttype = {arXiv}, eprint = {2107.05717}, timestamp = {Tue, 20 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-05717.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/CairoCR20, author = {Massimo Cairo and Carlo Comin and Romeo Rizzi}, title = {Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks}, journal = {J. Log. Algebraic Methods Program.}, volume = {113}, pages = {100542}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100542}, doi = {10.1016/J.JLAMP.2020.100542}, timestamp = {Thu, 23 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/CairoCR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-10498, author = {Massimo Cairo and Romeo Rizzi and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph}, journal = {CoRR}, volume = {abs/2002.10498}, year = {2020}, url = {https://arxiv.org/abs/2002.10498}, eprinttype = {arXiv}, eprint = {2002.10498}, timestamp = {Tue, 03 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-10498.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-15024, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {Computing all s-t bridges and articulation points simplified}, journal = {CoRR}, volume = {abs/2006.15024}, year = {2020}, url = {https://arxiv.org/abs/2006.15024}, eprinttype = {arXiv}, eprint = {2006.15024}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-15024.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-04726, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu}, title = {Safety in s-t Paths, Trails and Walks}, journal = {CoRR}, volume = {abs/2007.04726}, year = {2020}, url = {https://arxiv.org/abs/2007.04726}, eprinttype = {arXiv}, eprint = {2007.04726}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-04726.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-07575, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, title = {On the parameterized complexity of the Minimum Path Cover problem in DAGs}, journal = {CoRR}, volume = {abs/2007.07575}, year = {2020}, url = {https://arxiv.org/abs/2007.07575}, eprinttype = {arXiv}, eprint = {2007.07575}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-07575.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-12635, author = {Massimo Cairo and Shahbaz Khan and Romeo Rizzi and Sebastian S. Schmidt and Alexandru I. Tomescu and Elia C. Zirondelli}, title = {Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms}, journal = {CoRR}, volume = {abs/2011.12635}, year = {2020}, url = {https://arxiv.org/abs/2011.12635}, eprinttype = {arXiv}, eprint = {2011.12635}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-12635.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sensors/MorelliRCC19, author = {Davide Morelli and Alessio Rossi and Massimo Cairo and David A. Clifton}, title = {Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on {HRV} Features Estimations}, journal = {Sensors}, volume = {19}, number = {14}, pages = {3163}, year = {2019}, url = {https://doi.org/10.3390/s19143163}, doi = {10.3390/S19143163}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sensors/MorelliRCC19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/CairoMART19, author = {Massimo Cairo and Paul Medvedev and Nidia Obscura Acosta and Romeo Rizzi and Alexandru I. Tomescu}, title = {An Optimal \emph{O}(\emph{nm}) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph}, journal = {{ACM} Trans. Algorithms}, volume = {15}, number = {4}, pages = {48:1--48:17}, year = {2019}, url = {https://doi.org/10.1145/3341731}, doi = {10.1145/3341731}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/CairoMART19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/RizziCMT019, author = {Romeo Rizzi and Massimo Cairo and Veli M{\"{a}}kinen and Alexandru I. Tomescu and Daniel Valenzuela}, title = {Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {16}, number = {1}, pages = {23--30}, year = {2019}, url = {https://doi.org/10.1109/TCBB.2018.2831691}, doi = {10.1109/TCBB.2018.2831691}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/RizziCMT019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CairoR19, author = {Massimo Cairo and Romeo Rizzi}, title = {Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution}, journal = {Theor. Comput. Sci.}, volume = {797}, pages = {2--16}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.11.005}, doi = {10.1016/J.TCS.2018.11.005}, timestamp = {Tue, 26 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CairoR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoHR18, author = {Massimo Cairo and Luke Hunsberger and Romeo Rizzi}, editor = {Natasha Alechina and Kjetil N{\o}rv{\aa}g and Wojciech Penczek}, title = {Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty}, booktitle = {25th International Symposium on Temporal Representation and Reasoning, {TIME} 2018, Warsaw, Poland, October 15-17, 2018}, series = {LIPIcs}, volume = {120}, pages = {8:1--8:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.TIME.2018.8}, doi = {10.4230/LIPICS.TIME.2018.8}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CairoMART17, author = {Massimo Cairo and Paul Medvedev and Nidia Obscura Acosta and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Optimal Omnitig Listing for Safe and Complete Contig Assembly}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {29:1--29:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.29}, doi = {10.4230/LIPICS.CPM.2017.29}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/cpm/CairoMART17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CairoR17, author = {Massimo Cairo and Romeo Rizzi}, editor = {Philip N. Klein}, title = {The Complexity of Simulation and Matrix Multiplication}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {2203--2214}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.144}, doi = {10.1137/1.9781611974782.144}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/CairoR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoR17, author = {Massimo Cairo and Romeo Rizzi}, editor = {Sven Schewe and Thomas Schneider and Jef Wijsen}, title = {Dynamic Controllability Made Simple}, booktitle = {24th International Symposium on Temporal Representation and Reasoning, {TIME} 2017, October 16-18, 2017, Mons, Belgium}, series = {LIPIcs}, volume = {90}, pages = {8:1--8:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.TIME.2017.8}, doi = {10.4230/LIPICS.TIME.2017.8}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoCCHPRZ17, author = {Massimo Cairo and Carlo Combi and Carlo Comin and Luke Hunsberger and Roberto Posenato and Romeo Rizzi and Matteo Zavatteri}, editor = {Sven Schewe and Thomas Schneider and Jef Wijsen}, title = {Incorporating Decision Nodes into Conditional Simple Temporal Networks}, booktitle = {24th International Symposium on Temporal Representation and Reasoning, {TIME} 2017, October 16-18, 2017, Mons, Belgium}, series = {LIPIcs}, volume = {90}, pages = {9:1--9:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.TIME.2017.9}, doi = {10.4230/LIPICS.TIME.2017.9}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoCCHPRZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoHPR17, author = {Massimo Cairo and Luke Hunsberger and Roberto Posenato and Romeo Rizzi}, editor = {Sven Schewe and Thomas Schneider and Jef Wijsen}, title = {A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results}, booktitle = {24th International Symposium on Temporal Representation and Reasoning, {TIME} 2017, October 16-18, 2017, Mons, Belgium}, series = {LIPIcs}, volume = {90}, pages = {10:1--10:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.TIME.2017.10}, doi = {10.4230/LIPICS.TIME.2017.10}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoHPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/CairoFR16, author = {Massimo Cairo and Gabriele Farina and Romeo Rizzi}, editor = {Dale Schuurmans and Michael P. Wellman}, title = {Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication}, booktitle = {Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, {USA}}, pages = {1484--1490}, publisher = {{AAAI} Press}, year = {2016}, url = {https://doi.org/10.1609/aaai.v30i1.10263}, doi = {10.1609/AAAI.V30I1.10263}, timestamp = {Mon, 04 Sep 2023 15:08:28 +0200}, biburl = {https://dblp.org/rec/conf/aaai/CairoFR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CairoGR16, author = {Massimo Cairo and Roberto Grossi and Romeo Rizzi}, editor = {Robert Krauthgamer}, title = {New Bounds for Approximating Extremal Distances in Undirected Graphs}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016}, pages = {363--376}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974331.ch27}, doi = {10.1137/1.9781611974331.CH27}, timestamp = {Tue, 02 Feb 2021 17:07:56 +0100}, biburl = {https://dblp.org/rec/conf/soda/CairoGR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoCR16, author = {Massimo Cairo and Carlo Comin and Romeo Rizzi}, editor = {Curtis E. Dyreson and Michael R. Hansen and Luke Hunsberger}, title = {Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks}, booktitle = {23rd International Symposium on Temporal Representation and Reasoning, {TIME} 2016, Kongens Lyngby, Denmark, October 17-19, 2016}, pages = {80--89}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/TIME.2016.16}, doi = {10.1109/TIME.2016.16}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoCR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/time/CairoR16, author = {Massimo Cairo and Romeo Rizzi}, editor = {Curtis E. Dyreson and Michael R. Hansen and Luke Hunsberger}, title = {Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete}, booktitle = {23rd International Symposium on Temporal Representation and Reasoning, {TIME} 2016, Kongens Lyngby, Denmark, October 17-19, 2016}, pages = {90--99}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/TIME.2016.17}, doi = {10.1109/TIME.2016.17}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/time/CairoR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CairoR16, author = {Massimo Cairo and Romeo Rizzi}, title = {The Complexity of Simulation and (Exotic) Matrix Multiplications}, journal = {CoRR}, volume = {abs/1605.02156}, year = {2016}, url = {http://arxiv.org/abs/1605.02156}, eprinttype = {arXiv}, eprint = {1605.02156}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CairoR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CairoCR16, author = {Massimo Cairo and Carlo Comin and Romeo Rizzi}, title = {Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks}, journal = {CoRR}, volume = {abs/1608.04132}, year = {2016}, url = {http://arxiv.org/abs/1608.04132}, eprinttype = {arXiv}, eprint = {1608.04132}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CairoCR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CairoR16a, author = {Massimo Cairo and Romeo Rizzi}, title = {Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete}, journal = {CoRR}, volume = {abs/1608.08545}, year = {2016}, url = {http://arxiv.org/abs/1608.08545}, eprinttype = {arXiv}, eprint = {1608.08545}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CairoR16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RizziCMV16, author = {Romeo Rizzi and Massimo Cairo and Veli M{\"{a}}kinen and Daniel Valenzuela}, title = {Diploid Alignment is NP-hard}, journal = {CoRR}, volume = {abs/1611.05086}, year = {2016}, url = {http://arxiv.org/abs/1611.05086}, eprinttype = {arXiv}, eprint = {1611.05086}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RizziCMV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CairoFR15, author = {Massimo Cairo and Gabriele Farina and Romeo Rizzi}, title = {Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication}, journal = {CoRR}, volume = {abs/1512.00077}, year = {2015}, url = {http://arxiv.org/abs/1512.00077}, eprinttype = {arXiv}, eprint = {1512.00077}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CairoFR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.