Randomized greedy algorithms for the hypergraph partitioning problem. - Roberto Battiti; Alan A. Bertossi; Romeo Rizzi (Randomization Methods in Algorithm Design, 1997)

Improving a Family of Approximation Algorithms to Edge Color Multigraphs. - Alberto Caprara; Romeo Rizzi (Inf. Process. Lett., 1998)

König's edge coloring theorem without augmenting paths. - Romeo Rizzi (J. Graph Theory, 1998)

Indecomposable r-graphs and some other counterexamples. - Romeo Rizzi (J. Graph Theory, 1999)

NOTE - On Minimizing Symmetric Set Functions. - Romeo Rizzi (Comb., 2000)

A Note on Range-Restricted Circuit Covers. - Romeo Rizzi (Graphs Comb., 2000)

Edge-Coloring Bipartite Graphs. - Ajai Kapoor; Romeo Rizzi (J. Algorithms, 2000)

A short proof of König's matching theorem. - Romeo Rizzi (J. Graph Theory, 2000)

Packing Cycles and Cuts in Undirected Graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (ESA, 2001)

Some simple distributed algorithms for sparse networks. - Alessandro Panconesi; Romeo Rizzi (Distributed Comput., 2001)

Shortest paths in conservative graphs. - Michele Conforti; Romeo Rizzi (Discret. Math., 2001)

On the recognition of P4-indifferent graphs. - Romeo Rizzi (Discret. Math., 2001)

On 4-connected graphs without even cycle decompositions. - Romeo Rizzi (Discret. Math., 2001)

Excluding a Simple Good Pair Approach to Directed Cuts. - Romeo Rizzi (Graphs Comb., 2001)

Complexity of Context-Free Grammars with Exceptions and the Inadequacy of Grammars as Models for XML and SGML. - Romeo Rizzi (Markup Lang., 2001)

Routing Permutations in Partitioned Optical Passive Star Networks. - Alessandro Mei; Romeo Rizzi (IPDPS, 2002)

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. - Romeo Rizzi; Vineet Bafna; Sorin Istrail; Giuseppe Lancia (WABI, 2002)

Cycle cover property and CPP=SCC property are not equivalent. - Romeo Rizzi (Discret. Math., 2002)

Minimum T-cuts and optimal T-pairings. - Romeo Rizzi (Discret. Math., 2002)

Packing triangles in bounded degree graphs. - Alberto Caprara; Romeo Rizzi (Inf. Process. Lett., 2002)

Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. - Alberto Caprara; Romeo Rizzi (J. Comb. Optim., 2002)

Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. - Romeo Rizzi (SIAM J. Discret. Math., 2002)

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. - Zhi-Zhong Chen; Tao Jiang 001; Guohui Lin; Romeo Rizzi; Jianjun Wen; Dong Xu 002; Ying Xu 001 (ESA, 2003)

Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. - Alessandro Mei; Romeo Rizzi (HiPC, 2003)

Channel Assignment in Honeycomb Networks. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi; Anil M. Shende (ICTCS, 2003)

A DP algorithm for speaker change detection. - Michele Vescovi; Mauro Cettolo; Romeo Rizzi (INTERSPEECH, 2003)

Channel Assignment on Strongly-Simplicial Graphs. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi (IPDPS, 2003)

Allocating Servers in Infostations for On-Demand Communications. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi; Phalguni Gupta (IPDPS, 2003)

A simple minimum T-cut algorithm. - Romeo Rizzi (Discret. Appl. Math., 2003)

On the complexity of digraph packings. - Richard C. Brewster; Romeo Rizzi (Inf. Process. Lett., 2003)

On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. - Romeo Rizzi (Inf. Process. Lett., 2003)

Packing cycles in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (J. Algorithms, 2003)

Packing paths in digraphs. - Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo (J. Graph Theory, 2003)

Routing permutations in Partitioned Optical Passive Stars Networks. - Alessandro Mei; Romeo Rizzi (J. Parallel Distributed Comput., 2003)

Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. - Alan A. Bertossi; Maria Cristina Pinotti; Shashank Ramaprasad; Romeo Rizzi; Madhusudana V. S. Shashanka (IPDPS, 2004)

Combinatorial optimization - Polyhedra and efficiency: A book review. - Michelangelo Conforti; Romeo Rizzi (4OR, 2004)

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. - Giuseppe Lancia; Maria Cristina Pinotti; Romeo Rizzi (INFORMS J. Comput., 2004)

Allocating servers in infostations for bounded simultaneous requests. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi; Phalguni Gupta (J. Parallel Distributed Comput., 2004)

Channel assignment for interference avoidance in honeycomb wireless networks. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi; Anil M. Shende (J. Parallel Distributed Comput., 2004)

On d-threshold graphs and d-dimensional bin packing. - Alberto Caprara; Andrea Lodi 001; Romeo Rizzi (Networks, 2004)

Packing cuts in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (Networks, 2004)

Conserved Interval Distance Computation Between Non-trivial Genomes. - Guillaume Blin; Romeo Rizzi (COCOON, 2005)

What Makes the Arc-Preserving Subsequence Problem Hard? - Guillaume Blin; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (International Conference on Computational Science (2), 2005)

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. - Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (MFCS, 2005)

The String Barcoding Problem is NP-Hard. - Marcello Dalpasso; Giuseppe Lancia; Romeo Rizzi (Comparative Genomics, 2005)

Evaluation of BIC-based algorithms for audio segmentation. - Mauro Cettolo; Michele Vescovi; Romeo Rizzi (Comput. Speech Lang., 2005)

A greedy approach to compute a minimum cycle basis of a directed graph. - Christian Liebchen; Romeo Rizzi (Inf. Process. Lett., 2005)

Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel. - Elia Ardizzoni; Alan A. Bertossi; Maria Cristina Pinotti; Shashank Ramaprasad; Romeo Rizzi; Madhusudana V. S. Shashanka (IEEE Trans. Computers, 2005)

Polynomial and APX-hard cases of the individual haplotyping problem. - Vineet Bafna; Sorin Istrail; Giuseppe Lancia; Romeo Rizzi (Theor. Comput. Sci., 2005)

Approximation of RNA Multiple Structural Alignment. - Marcin Kubica 001; Romeo Rizzi; Stéphane Vialette; Tomasz Walen (CPM, 2006)

Genomes Containing Duplicates Are Hard to Compare. - Cédric Chauve; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (International Conference on Computational Science (2), 2006)

On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. - Reuven Cohen; Romeo Rizzi (INFOCOM, 2006)

Flipping letters to minimize the support of a string. - Giuseppe Lancia; Franca Rinaldi; Romeo Rizzi (PSC, 2006)

The approximability of the String Barcoding problem. - Giuseppe Lancia; Romeo Rizzi (Algorithms Mol. Biol., 2006)

Acyclically pushable bipartite permutation digraphs: An algorithm. - Romeo Rizzi (Discret. Math., 2006)

Covering partially directed graphs with directed paths. - Romeo Rizzi; Marco Rospocher (Discret. Math., 2006)

A polynomial case of the parsimony haplotyping problem. - Giuseppe Lancia; Romeo Rizzi (Oper. Res. Lett., 2006)

Online Permutation Routing in Partitioned Optical Passive Star Networks. - Alessandro Mei; Romeo Rizzi (IEEE Trans. Computers, 2006)

Hypercube Computations on Partitioned Optical Passive Stars Networks. - Alessandro Mei; Romeo Rizzi (IEEE Trans. Parallel Distributed Syst., 2006)

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. - Guillaume Fertin; Danny Hermelin; Romeo Rizzi; Stéphane Vialette (CPM, 2007)

Pattern Matching in Protein-Protein Interaction Graphs. - Gaëlle Brevier; Romeo Rizzi; Stéphane Vialette (FCT, 2007)

The Minimum Substring Cover Problem. - Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette (WAOA, 2007)

Benchmarks for Strictly Fundamental Cycle Bases. - Christian Liebchen; Gregor Wünsch; Ekkehard Köhler; Alexander Reich; Romeo Rizzi (WEA, 2007)

Classes of cycle bases. - Christian Liebchen; Romeo Rizzi (Discret. Appl. Math., 2007)

Least and most colored bases. - Francesco Maffioli; Romeo Rizzi; Stefano Benati (Discret. Appl. Math., 2007)

The firefighter problem for graphs of maximum degree three. - Stephen Finbow; Andrew D. King; Gary MacGillivray; Romeo Rizzi (Discret. Math., 2007)

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. - Stefano Benati; Romeo Rizzi (Eur. J. Oper. Res., 2007)

New length bounds for cycle bases. - Michael Elkin; Christian Liebchen; Romeo Rizzi (Inf. Process. Lett., 2007)

Comparing Genomes with Duplications: A Computational Complexity Point of View. - Guillaume Blin; Cédric Chauve; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Scheduling Data Broadcasts on Wireless Channels. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Oriented star packings. - Richard C. Brewster; Pavol Hell; Romeo Rizzi (J. Comb. Theory B, 2008)

Haplotyping for Disease Association: A Combinatorial Approach. - Giuseppe Lancia; R. Ravi 001; Romeo Rizzi (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. - Reuven Cohen; Liran Katzir 001; Romeo Rizzi (IEEE Trans. Mob. Comput., 2008)

Breaking the O(m2n) Barrier for Minimum Cycle Bases. - Edoardo Amaldi; Claudio Iuliano; Tomasz Jurkiewicz; Kurt Mehlhorn; Romeo Rizzi (ESA, 2009)

Pure Parsimony Xor Haplotyping. - Paola Bonizzoni; Gianluca Della Vedova; Riccardo Dondi; Yuri Pirola; Romeo Rizzi (ISBRA, 2009)

Minimum Weakly Fundamental Cycle Bases Are Hard To Find. - Romeo Rizzi (Algorithmica, 2009)

Cycle bases in graphs characterization, algorithms, complexity, and applications. - Telikepalli Kavitha; Christian Liebchen; Kurt Mehlhorn; Dimitrios Michail 001; Romeo Rizzi; Torsten Ueckerdt; Katharina A. Zweig (Comput. Sci. Rev., 2009)

Optimal receiver scheduling algorithms for a multicast problem. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi (Discret. Appl. Math., 2009)

Approximating the maximum 3-edge-colorable subgraph problem. - Romeo Rizzi (Discret. Math., 2009)

Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. - Péter Biró 001; David F. Manlove; Romeo Rizzi (Discret. Math. Algorithms Appl., 2009)

Finding occurrences of protein complexes in protein-protein interaction graphs. - Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (J. Discrete Algorithms, 2009)

The optimal statistical median of a convex set of arrays. - Stefano Benati; Romeo Rizzi (J. Glob. Optim., 2009)

Lower bounds for strictly fundamental cycle bases in grid graphs. - Ekkehard Köhler; Christian Liebchen; Gregor Wünsch; Romeo Rizzi (Networks, 2009)

A Faster Algorithm for Finding Minimum Tucker Submatrices. - Guillaume Blin; Romeo Rizzi; Stéphane Vialette (CiE, 2010)

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. - Edoardo Amaldi; Claudio Iuliano; Romeo Rizzi (IPCO, 2010)

Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. - Giuseppe Lancia; Romeo Rizzi; Russell Schwartz (PSC, 2010)

Excessive factorizations of bipartite multigraphs. - David Cariolaro; Romeo Rizzi (Discret. Appl. Math., 2010)

Complexity issues in color-preserving graph embeddings. - Gaëlle Brevier; Romeo Rizzi; Stéphane Vialette (Theor. Comput. Sci., 2010)

Finding common structured patterns in linear graphs. - Guillaume Fertin; Danny Hermelin; Romeo Rizzi; Stéphane Vialette (Theor. Comput. Sci., 2010)

Minimum Mosaic Inference of a Set of Recombinants. - Guillaume Blin; Romeo Rizzi; Florian Sikora; Stéphane Vialette (CATS, 2011)

On cycle bases with limited edge overlap. - Edoardo Amaldi; Claudio Iuliano; Romeo Rizzi (CTW, 2011)

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. - Guillaume Blin; Romeo Rizzi; Stéphane Vialette (CSR, 2011)

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. - Rui A. Ferreira; Roberto Grossi; Romeo Rizzi (ESA, 2011)

On the approximability of the minimum strictly fundamental cycle basis problem. - Giulia Galbiati; Romeo Rizzi; Edoardo Amaldi (Discret. Appl. Math., 2011)

Some Results on more Flexible Versions of Graph Motif. - Romeo Rizzi; Florian Sikora (CSR, 2012)

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. - Danny Hermelin; Romeo Rizzi; Stéphane Vialette (ISAAC, 2012)

Complexity Insights of the Minimum Duplication Problem. - Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Romeo Rizzi; Florian Sikora (SOFSEM, 2012)

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. - Xiao Yang 019; Florian Sikora; Guillaume Blin; Sylvie Hamel; Romeo Rizzi; Srinivas Aluru (TAMC, 2012)

Optimal Listing of Cycles and st-Paths in Undirected Graphs - Etienne Birmelé; Rui A. Ferreira; Roberto Grossi; Andrea Marino 001; Nadia Pisanti; Romeo Rizzi; Gustavo Akio Tominaga Sacomoto; Marie-France Sagot (CoRR, 2012)

On Recognizing Words That Are Squares for the Shuffle Product. - Romeo Rizzi; Stéphane Vialette (CSR, 2013)

Optimal Listing of Cycles and st-Paths in Undirected Graphs. - Etienne Birmelé; Rui A. Ferreira; Roberto Grossi; Andrea Marino 001; Nadia Pisanti; Romeo Rizzi; Gustavo Sacomoto (SODA, 2013)

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. - Ferdinando Cicalese; Travis Gagie; Emanuele Giaquinta; Eduardo Sany Laber; Zsuzsanna Lipták; Romeo Rizzi; Alexandru I. Tomescu (SPIRE, 2013)

Optimal Design of Consistent Simple Temporal Networks. - Romeo Rizzi; Roberto Posenato (TIME, 2013)

A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. - Alexandru I. Tomescu; Anna Kuosmanen; Romeo Rizzi; Veli Mäkinen (WABI, 2013)

A novel min-cost flow method for estimating transcript expression with RNA-Seq. - Alexandru I. Tomescu; Anna Kuosmanen; Romeo Rizzi; Veli Mäkinen (BMC Bioinform., 2013)

Floating-point arithmetic for approximate counting and random generation problems. - Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2013)

Ranking, unranking and random generation of extensional acyclic digraphs. - Romeo Rizzi; Alexandru I. Tomescu (Inf. Process. Lett., 2013)

Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. - Rui A. Ferreira; Roberto Grossi; Romeo Rizzi; Gustavo Sacomoto; Marie-France Sagot (ESA, 2014)

Faster FPTASes for Counting and Random Generation of Knapsack Solutions. - Romeo Rizzi; Alexandru I. Tomescu (ESA, 2014)

Efficiently Listing Bounded Length st-Paths. - Romeo Rizzi; Gustavo Sacomoto; Marie-France Sagot (IWOCA, 2014)

Towards Unlocking the Full Potential of Multileaf Collimators. - Guillaume Blin; Paul Morel; Romeo Rizzi; Stéphane Vialette (SOFSEM, 2014)

Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems. - Giorgio Bacci; Marino Miculan; Romeo Rizzi (TGC, 2014)

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games. - Carlo Comin; Roberto Posenato; Romeo Rizzi (TIME, 2014)

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. - Romeo Rizzi; David Cariolaro (Algorithmica, 2014)

On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. - Romeo Rizzi; Alexandru I. Tomescu; Veli Mäkinen (BMC Bioinform., 2014)

Dominating sequences in graphs. - Bostjan Bresar; Tanja Gologranc; Martin Milanic; Douglas F. Rall; Romeo Rizzi (Discret. Math., 2014)

Odd 2-factored snarks. - Marién Abreu; Domenico Labbate; Romeo Rizzi; John Sheehan (Eur. J. Comb., 2014)

Set graphs. II. Complexity of set graph recognition and similar problems. - Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (Theor. Comput. Sci., 2014)

Enumerating Cyclic Orientations of a Graph. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (IWOCA, 2015)

The Price of Evolution in Temporal Databases. - Carlo Combi; Romeo Rizzi; Pietro Sala (TIME, 2015)

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking. - Carlo Comin; Romeo Rizzi (TIME, 2015)

Hyper Temporal Networks. - Carlo Comin; Roberto Posenato; Romeo Rizzi (CoRR, 2015)

An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. - Carlo Comin; Romeo Rizzi (CoRR, 2015)

Pattern matching in $(213, 231)$-avoiding permutations. - Both Emerite Neou; Romeo Rizzi; Stéphane Vialette (CoRR, 2015)

Some algorithmic results for [2]-sumset covers. - Laurent Bulteau; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (Inf. Process. Lett., 2015)

Friendly bin packing instances without Integer Round-up Property. - Alberto Caprara; Mauro Dell'Amico; José Carlos Díaz Díaz; Manuel Iori; Romeo Rizzi (Math. Program., 2015)

The complexity of power indexes with graph restricted coalitions. - Stefano Benati; Romeo Rizzi; Craig A. Tovey (Math. Soc. Sci., 2015)

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. - Alexandru I. Tomescu; Travis Gagie; Alexandru Popa 001; Romeo Rizzi; Anna Kuosmanen; Veli Mäkinen (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

On the complexity of the vector connectivity problem. - Ferdinando Cicalese; Martin Milanic; Romeo Rizzi (Theor. Comput. Sci., 2015)

Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. - Massimo Cairo; Gabriele Farina; Romeo Rizzi (AAAI, 2016)

Sorting with Forbidden Intermediates. - Carlo Comin; Anthony Labarre; Romeo Rizzi; Stéphane Vialette (AlCoB, 2016)

On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. - Anna Kuosmanen; Ahmed Sobih; Romeo Rizzi; Veli Mäkinen; Alexandru I. Tomescu (BIOINFORMATICS, 2016)

Decomposing Cubic Graphs into Connected Subgraphs of Size Three. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (COCOON, 2016)

Directing Road Networks by Listing Strong Orientations. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Luca Versari (IWOCA, 2016)

Listing Acyclic Orientations of Graphs with Single and Multiple Sources. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (LATIN, 2016)

Minimal Multiset Grammars for Recurrent Dynamics. - Alessandro Farinelli; Giuditta Franco; Romeo Rizzi (Int. Conf. on Membrane Computing, 2016)

New Bounds for Approximating Extremal Distances in Undirected Graphs. - Massimo Cairo; Roberto Grossi; Romeo Rizzi (SODA, 2016)

Pattern Matching for Separable Permutations. - Both Emerite Neou; Romeo Rizzi; Stéphane Vialette (SPIRE, 2016)

Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. - Massimo Cairo; Carlo Comin; Romeo Rizzi (TIME, 2016)

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. - Massimo Cairo; Romeo Rizzi (TIME, 2016)

The Complexity of Simulation and (Exotic) Matrix Multiplications. - Massimo Cairo; Romeo Rizzi (CoRR, 2016)

Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games. - Carlo Comin; Romeo Rizzi (CoRR, 2016)

Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games). - Carlo Comin; Romeo Rizzi (CoRR, 2016)

Diploid Alignment is NP-hard. - Romeo Rizzi; Massimo Cairo; Veli Mäkinen; Daniel Valenzuela 001 (CoRR, 2016)

Strong cliques and equistability of EPT graphs. - Liliana Alcón; Marisa Gutierrez; István Kovács; Martin Milanic; Romeo Rizzi (Discret. Appl. Math., 2016)

Permutation Pattern matching in (213, 231)-avoiding permutations. - Both Emerite Neou; Romeo Rizzi; Stéphane Vialette (Discret. Math. Theor. Comput. Sci., 2016)

On the Complexity of Computing the Excessive [B]-Index of a Graph. - David Cariolaro; Romeo Rizzi (J. Graph Theory, 2016)

Optimal Omnitig Listing for Safe and Complete Contig Assembly. - Massimo Cairo; Paul Medvedev; Nidia Obscura Acosta; Romeo Rizzi; Alexandru I. Tomescu (CPM, 2017)

The Complexity of Simulation and Matrix Multiplication. - Massimo Cairo; Romeo Rizzi (SODA, 2017)

Incorporating Decision Nodes into Conditional Simple Temporal Networks. - Massimo Cairo; Carlo Combi; Carlo Comin; Luke Hunsberger; Roberto Posenato; Romeo Rizzi; Matteo Zavatteri (TIME, 2017)

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. - Massimo Cairo; Luke Hunsberger; Roberto Posenato; Romeo Rizzi (TIME, 2017)

Dynamic Controllability Made Simple. - Massimo Cairo; Romeo Rizzi (TIME, 2017)

On Bubble Generators in Directed Graphs. - Vicente Acuña; Roberto Grossi; Giuseppe F. Italiano; Leandro Lima; Romeo Rizzi; Gustavo Sacomoto; Marie-France Sagot; Blerina Sinaimeri (WG, 2017)

The Minimum Conflict-Free Row Split Problem Revisited. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (WG, 2017)

Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. - Carlo Comin; Romeo Rizzi (Algorithmica, 2017)

Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games. - Carlo Comin; Roberto Posenato; Romeo Rizzi (Constraints An Int. J., 2017)

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2017)

Solving the train marshalling problem by inclusion-exclusion. - Franca Rinaldi; Romeo Rizzi (Discret. Appl. Math., 2017)

Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data. - Alan A. Bertossi; Maria Cristina Pinotti; Romeo Rizzi (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Pattern Matching for k-Track Permutations. - Laurent Bulteau; Romeo Rizzi; Stéphane Vialette (IWOCA, 2018)

Listing Subgraphs by Cartesian Decomposition. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Luca Versari (MFCS, 2018)

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. - Massimo Cairo; Luke Hunsberger; Romeo Rizzi (TIME, 2018)

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. - Carlo Comin; Romeo Rizzi (TIME, 2018)

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Takeaki Uno; Luca Versari (WG, 2018)

An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. - Carlo Comin; Romeo Rizzi (Algorithmica, 2018)

Efficient enumeration of graph orientations with sources. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (Discret. Appl. Math., 2018)

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm. - Carlo Comin; Romeo Rizzi (Inf. Comput., 2018)

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (ACM Trans. Algorithms, 2018)

Network Synthesis for Distributed Embedded Systems. - Enrico Fraccaroli; Francesco Stefanni; Romeo Rizzi; Davide Quaglia; Franco Fummi (IEEE Trans. Computers, 2018)

Strong Controllability of Temporal Networks with Decisions. - Matteo Zavatteri; Romeo Rizzi; Tiziano Villa (OVERLAY@AI*IA, 2019)

Complexity of Weak, Strong and Dynamic Controllability of CNCUs. - Matteo Zavatteri; Romeo Rizzi; Tiziano Villa (OVERLAY@AI*IA, 2019)

When a Dollar Makes a BWT. - Sara Giuliani; Zsuzsanna Lipták; Romeo Rizzi (ICTCS, 2019)

Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions. - Matteo Zavatteri; Carlo Combi; Romeo Rizzi; Luca Viganò 001 (TIME, 2019)

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. - Edin Husic; Xinyue Li; Ademir Hujdurovic; Miika Mehine; Romeo Rizzi; Veli Mäkinen; Martin Milanic; Alexandru I. Tomescu (Bioinform., 2019)

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. - Massimo Cairo; Paul Medvedev; Nidia Obscura Acosta; Romeo Rizzi; Alexandru I. Tomescu (ACM Trans. Algorithms, 2019)

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. - Romeo Rizzi; Massimo Cairo; Veli Mäkinen; Alexandru I. Tomescu; Daniel Valenzuela 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. - Massimo Cairo; Romeo Rizzi (Theor. Comput. Sci., 2019)

Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty. - Matteo Zavatteri; Romeo Rizzi; Tiziano Villa (ICAPS, 2020)

On the Complexity of Resource Controllability in Business Process Management. - Matteo Zavatteri; Romeo Rizzi; Tiziano Villa (Business Process Management Workshops, 2020)

From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Computing all s-t bridges and articulation points simplified. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

On the parameterized complexity of the Minimum Path Cover problem in DAGs. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2020)

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Discovering Evolving Temporal Information: Theory and Application to Clinical Databases. - Pietro Sala; Carlo Combi; Matteo Mantovani 001; Romeo Rizzi (SN Comput. Sci., 2020)

Faster and Better Simple Temporal Problems. - Dario Ostuni; Alice Raffaele; Romeo Rizzi; Matteo Zavatteri (AAAI, 2021)

Make your programs compete and watch them play in the Code Colosseum. - Dario Ostuni; Edoardo Morassutto; Romeo Rizzi (CoG, 2021)

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (ICALP, 2021)

A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (WG, 2021)

Algorithmic aspects of quasi-kernels. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (CoRR, 2021)

A simplified algorithm computing all s-t bridges and articulation points. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (Discret. Appl. Math., 2021)

Checking Sets of Pure Evolving Association Rules. - Carlo Combi; Romeo Rizzi; Pietro Sala (Fundam. Informaticae, 2021)

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way. - Matteo Zavatteri; Carlo Combi; Romeo Rizzi; Luca Viganò 001 (Inf. Comput., 2021)

Decomposing subcubic graphs into claws, paths or triangles. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (J. Graph Theory, 2021)

When a dollar makes a BWT. - Sara Giuliani; Zsuzsanna Lipták; Francesco Masillo; Romeo Rizzi (Theor. Comput. Sci., 2021)

Dynamic Controllability of Temporal Networks via Supervisory Control. - Matteo Zavatteri; Davide Bresolin; Romeo Rizzi; Tiziano Villa (OVERLAY@AI*IA, 2022)

Width Helps and Hinders Splitting Flows. - Manuel Cáceres; Massimo Cairo; Andreas Grigorjew; Shahbaz Khan 004; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu; Lucia Williams (ESA, 2022)

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (SODA, 2022)

Algorithmic Aspects of Small Quasi-Kernels. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (WG, 2022)

Safety in s-t Paths, Trails and Walks. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu (Algorithmica, 2022)

Solving the Probabilistic Profitable Tour Problem on a Tree. - Enrico Angelelli; Renata Mansini; Romeo Rizzi (CoRR, 2022)

Minimum Path Cover in Parameterized Linear Time. - Manuel Cáceres; Massimo Cairo; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2022)

Dynamic controllability of temporal networks with instantaneous reaction. - Matteo Zavatteri; Romeo Rizzi; Tiziano Villa (Inf. Sci., 2022)

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. - Manuel Cáceres; Brendan Mumey; Edin Husic; Romeo Rizzi; Massimo Cairo; Kristoffer Sahlin; Alexandru I. Tomescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Recognizing Unit Multiple Intervals Is Hard. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora; Stéphane Vialette (ISAAC, 2023)

Hardness of Balanced Mobiles. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora (IWOCA, 2023)

Cut Paths and Their Remainder Structure, with Applications. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (STACS, 2023)

Discovering Predictive Dependencies on Multi-Temporal Relations. - Beatrice Amico; Carlo Combi; Romeo Rizzi; Pietro Sala (TIME, 2023)

Quasi-kernels in split graphs. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (CoRR, 2023)

An interdisciplinary experimental evaluation on the disjunctive temporal problem. - Matteo Zavatteri; Alice Raffaele; Dario Ostuni; Romeo Rizzi (Constraints An Int. J., 2023)

On recognising words that are squares for the shuffle product. - Romeo Rizzi; Stéphane Vialette (Theor. Comput. Sci., 2023)

Solving the probabilistic profitable tour problem on a line. - Enrico Angelelli; Renata Mansini; Romeo Rizzi (Optim. Lett., 2023)

Generalizing Roberts' Characterization of Unit Interval Graphs. - Virginia Ardévol Martínez; Romeo Rizzi; Abdallah Saffidine; Florian Sikora; Stéphane Vialette (MFCS, 2024)

Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. - Andreas Grigorjew; Fernando H. C. Dias; Andrea Cracco; Romeo Rizzi; Alexandru I. Tomescu (SEA, 2024)

Listing the bonds of a graph in O˜(n)-delay. - Alice Raffaele; Romeo Rizzi; Takeaki Uno (Discret. Appl. Math., 2024)

Predictive mining of multi-temporal relations. - Beatrice Amico; Carlo Combi; Romeo Rizzi; Pietro Sala (Inf. Comput., 2024)

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. - Giulia Punzi; Alessio Conte; Roberto Grossi; Romeo Rizzi (Algorithmica, 2024)

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. - Massimo Cairo; Romeo Rizzi; Alexandru I. Tomescu; Elia C. Zirondelli (ACM Trans. Algorithms, 2024)

Turing Arena Light: Enhancing Programming Education Through Competitive Environments. - Giorgio Audrito; Luigi Laura; Alessio Orlandi; Dario Ostuni; Romeo Rizzi; Luca Versari (From Strings to Graphs, and Back Again, 2025)

Safe Sequences via Dominators in DAGs for Path-Covering Problems. - Francisco Sena; Romeo Rizzi; Alexandru I. Tomescu (ESA, 2025)

Quasi-kernels in split graphs. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette; Yacong Zhou (Discret. Appl. Math., 2025)

Recognizing unit multiple interval graphs is hard. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora; Stéphane Vialette (Discret. Appl. Math., 2025)

New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems. - Alice Raffaele; Romeo Rizzi (Discret. Appl. Math., 2025)

Linear-time safe-alternating DFS and SCCs. - Carlo Comin; Romeo Rizzi (Inf. Comput., 2025)

Business Process Compliance with impact constraints. - Tewabe Chekole Workneh; Pietro Sala; Romeo Rizzi; Matteo Cristani (Inf. Syst., 2025)

Revisiting Viewing Graph Solvability: An Effective Approach Based on Cycle Consistency. - Federica Arrigoni; Andrea Fusiello; Romeo Rizzi; Elisa Ricci 001; Tomás Pajdla (IEEE Trans. Pattern Anal. Mach. Intell., 2025)