Romeo Rizzi

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 120

Top Venues

Publications

Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86 (1) (2024)
Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu
Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. SEA (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS (2024)
Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
. ACM Trans. Algorithms 20 (1) (2024)
Alice Raffaele, Romeo Rizzi, Takeaki Uno
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348 (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)
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' characterization of unit interval graphs. CoRR (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing unit multiple intervals is hard. CoRR (2023)
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)
Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala
Discovering Predictive Dependencies on Multi-Temporal Relations. TIME (2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing Unit Multiple Intervals Is Hard. ISAAC (2023)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Quasi-kernels in split graphs. CoRR (2023)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17 (8) (2023)
Romeo Rizzi, Stéphane Vialette
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956 (2023)
Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi
An interdisciplinary experimental evaluation on the disjunctive temporal problem. Constraints An Int. J. 28 (1) (2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
Hardness of Balanced Mobiles. IWOCA (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)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic Aspects of Small Quasi-Kernels. WG (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)
Matteo Zavatteri, Davide Bresolin, Romeo Rizzi, Tiziano Villa
Dynamic Controllability of Temporal Networks via Supervisory Control. OVERLAY@AI*IA (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)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Minimum Path Cover in Parameterized Linear Time. CoRR (2022)
Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
Dynamic controllability of temporal networks with instantaneous reaction. Inf. Sci. 613 (2022)
Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi
When a dollar makes a BWT. Theor. Comput. Sci. 857 (2021)
Dario Ostuni, Edoardo Morassutto, Romeo Rizzi
Make your programs compete and watch them play in the Code Colosseum. CoG (2021)
Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way. Inf. Comput. 280 (2021)
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)
Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98 (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)
Carlo Combi, Romeo Rizzi, Pietro Sala
Checking Sets of Pure Evolving Association Rules. Fundam. Informaticae 178 (4) (2021)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic aspects of quasi-kernels. CoRR (2021)
Dario Ostuni, Alice Raffaele, Romeo Rizzi, Matteo Zavatteri
Faster and Better Simple Temporal Problems. AAAI (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)
Pietro Sala, Carlo Combi, Matteo Mantovani, Romeo Rizzi
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases. SN Comput. Sci. 1 (3) (2020)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting with forbidden intermediates. Discret. Appl. Math. 279 (2020)
Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
On Bubble Generators in Directed Graphs. Algorithmica 82 (4) (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)
Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
On the Complexity of Resource Controllability in Business Process Management. Business Process Management Workshops (2020)
Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty. ICAPS (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)
Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
Strong Controllability of Temporal Networks with Decisions. OVERLAY@AI*IA (2019)
Romeo Rizzi, Alexandru I. Tomescu
Faster FPTASes for counting and random generation of Knapsack solutions. Inf. Comput. 267 (2019)
Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi
When a Dollar Makes a BWT. ICTCS (2019)
Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
Complexity of Weak, Strong and Dynamic Controllability of CNCUs. OVERLAY@AI*IA (2019)
Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions. TIME (2019)
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)
Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35 (5) (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)
Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi
When a Dollar Makes a BWT. CoRR (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)
Carlo Comin, Romeo Rizzi
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm. Inf. Comput. 259 (3) (2018)
Carlo Comin, Romeo Rizzi
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Algorithmica 80 (12) (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG (2018)
Enrico Fraccaroli, Francesco Stefanni, Romeo Rizzi, Davide Quaglia, Franco Fummi
Network Synthesis for Distributed Embedded Systems. IEEE Trans. Computers 67 (9) (2018)
Massimo Cairo, Luke Hunsberger, Romeo Rizzi
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME (2018)
Carlo Comin, Romeo Rizzi
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. CoRR (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246 (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Listing Subgraphs by Cartesian Decomposition. MFCS (2018)
Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms 14 (2) (2018)
Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
Pattern Matching for k-Track Permutations. IWOCA (2018)
Carlo Comin, Romeo Rizzi
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. TIME (2018)
Massimo Cairo, Romeo Rizzi
The Complexity of Simulation and Matrix Multiplication. SODA (2017)
Franca Rinaldi, Romeo Rizzi
Solving the train marshalling problem by inclusion-exclusion. Discret. Appl. Math. 217 (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)
Carlo Comin, Romeo Rizzi
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. Algorithmica 77 (4) (2017)
Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR (2017)
Massimo Cairo, Romeo Rizzi
Dynamic Controllability Made Simple. TIME (2017)
Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
On Bubble Generators in Directed Graphs. WG (2017)
Carlo Comin, Roberto Posenato, Romeo Rizzi
Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games. Constraints An Int. J. 22 (2) (2017)
Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
The Minimum Conflict-Free Row Split Problem Revisited. WG (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)
Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR (2016)
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)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN (2016)
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Pattern Matching for Separable Permutations. SPIRE (2016)
Massimo Cairo, Carlo Comin, Romeo Rizzi
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME (2016)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting With Forbidden Intermediates. CoRR (2016)
Carlo Comin, Romeo Rizzi
Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games. CoRR (2016)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting with Forbidden Intermediates. AlCoB (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)
Carlo Comin, Romeo Rizzi
Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm). CoRR (2016)
Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu
On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. BIOINFORMATICS (2016)
Massimo Cairo, Gabriele Farina, Romeo Rizzi
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Directing Road Networks by Listing Strong Orientations. IWOCA (2016)
Carlo Comin, Romeo Rizzi
Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games). CoRR (2016)
David Cariolaro, Romeo Rizzi
]-Index of a Graph. J. Graph Theory 82 (1) (2016)
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. 18 (2) (2016)
Massimo Cairo, Romeo Rizzi
The Complexity of Simulation and (Exotic) Matrix Multiplications. CoRR (2016)

Romeo Rizzi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Romeo Rizzi