Romeo Rizzi - RankMe

269 papers A* 9A 14B 20C 26Misc 10Journal 172Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree. Math. Oper. Res. Enrico Angelelli, Renata Mansini, Romeo Rizzi
2025	J	`jnl`	Business Process Compliance with impact constraints. Inf. Syst. Tewabe Chekole Workneh, Pietro Sala, Romeo Rizzi, Matteo Cristani
2025	J	`jnl`	Linear-time safe-alternating DFS and SCCs. Inf. Comput. Carlo Comin, Romeo Rizzi
2025	J	`jnl`	New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems. Discret. Appl. Math. Alice Raffaele, Romeo Rizzi
2025	J	`jnl`	Quasi-kernels in split graphs. Discret. Appl. Math. Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette, Yacong Zhou
2025	J	`jnl`	Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2025	J	`jnl`	Revisiting Viewing Graph Solvability: An Effective Approach Based on Cycle Consistency. IEEE Trans. Pattern Anal. Mach. Intell. Federica Arrigoni, Andrea Fusiello, Romeo Rizzi, Elisa Ricci, Tomás Pajdla
2025	A	`conf`	Safe Sequences via Dominators in DAGs for Path-Covering Problems. ESA Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu
2025	—	`conf`	Turing Arena Light: Enhancing Programming Education Through Competitive Environments. From Strings to Graphs, and Back Again Giorgio Audrito, Luigi Laura, Alessio Orlandi, Dario Ostuni, Romeo Rizzi, Luca Versari
2024	B	`conf`	Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. SEA Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu
2024	B	`conf`	Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024	J	`jnl`	Generalizing Roberts' characterization of unit interval graphs. CoRR Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024	J	`jnl`	Genome Assembly, from Practice to Theory: Safe, Complete and ACM Trans. Algorithms Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2024	J	`jnl`	Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. Alice Raffaele, Romeo Rizzi, Takeaki Uno
2024	J	`jnl`	Predictive mining of multi-temporal relations. Inf. Comput. Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala
2024	J	`jnl`	Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
2024	J	`jnl`	Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2023	J	`jnl`	An interdisciplinary experimental evaluation on the disjunctive temporal problem. Constraints An Int. J. Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi
2023	A	`conf`	Cut Paths and Their Remainder Structure, with Applications. STACS Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2023	C	`conf`	Discovering Predictive Dependencies on Multi-Temporal Relations. TIME Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala
2023	C	`conf`	Hardness of Balanced Mobiles. IWOCA Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
2023	J	`jnl`	On recognising words that are squares for the shuffle product. Theor. Comput. Sci. Romeo Rizzi, Stéphane Vialette
2023	J	`jnl`	Quasi-kernels in split graphs. CoRR Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2023	B	`conf`	Recognizing Unit Multiple Intervals Is Hard. ISAAC Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2023	J	`jnl`	Recognizing unit multiple intervals is hard. CoRR Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2023	J	`jnl`	Solving the probabilistic profitable tour problem on a line. Optim. Lett. Enrico Angelelli, Renata Mansini, Romeo Rizzi
2022	B	`conf`	Algorithmic Aspects of Small Quasi-Kernels. WG Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2022	J	`jnl`	Cut paths and their remainder structure, with applications. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2022	—	`conf`	Dynamic Controllability of Temporal Networks via Supervisory Control. OVERLAY@AI*IA Matteo Zavatteri, Davide Bresolin, Romeo Rizzi, Tiziano Villa
2022	J	`jnl`	Dynamic controllability of temporal networks with instantaneous reaction. Inf. Sci. Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
2022	J	`jnl`	Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	J	`jnl`	Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
2022	J	`jnl`	Safety in s-t Paths, Trails and Walks. Algorithmica Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2022	J	`jnl`	Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR Enrico Angelelli, Renata Mansini, Romeo Rizzi
2022	A*	`conf`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	A	`conf`	Width Helps and Hinders Splitting Flows. ESA Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2022	J	`jnl`	Width Helps and Hinders Splitting Flows. CoRR Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2021	B	`conf`	A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	J	`jnl`	A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2021	J	`jnl`	Algorithmic aspects of quasi-kernels. CoRR Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2021	J	`jnl`	Checking Sets of Pure Evolving Association Rules. Fundam. Informaticae Carlo Combi, Romeo Rizzi, Pietro Sala
2021	J	`jnl`	Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way. Inf. Comput. Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò
2021	J	`jnl`	Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2021	A*	`conf`	Faster and Better Simple Temporal Problems. AAAI Dario Ostuni, Alice Raffaele, Romeo Rizzi, Matteo Zavatteri
2021	A*	`conf`	Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2021	C	`conf`	Make your programs compete and watch them play in the Code Colosseum. CoG Dario Ostuni, Edoardo Morassutto, Romeo Rizzi
2021	J	`jnl`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	J	`jnl`	When a dollar makes a BWT. Theor. Comput. Sci. Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi
2020	J	`jnl`	Computing all s-t bridges and articulation points simplified. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020	J	`jnl`	Discovering Evolving Temporal Information: Theory and Application to Clinical Databases. SN Comput. Sci. Pietro Sala, Carlo Combi, Matteo Mantovani, Romeo Rizzi
2020	A*	`conf`	Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty. ICAPS Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
2020	J	`jnl`	From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. CoRR Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2020	J	`jnl`	Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020	J	`jnl`	Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. J. Log. Algebraic Methods Program. Massimo Cairo, Carlo Comin, Romeo Rizzi
2020	J	`jnl`	On Bubble Generators in Directed Graphs. Algorithmica Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
2020	—	`conf`	On the Complexity of Resource Controllability in Business Process Management. Business Process Management Workshops Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
2020	J	`jnl`	On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2020	J	`jnl`	Safety in s-t Paths, Trails and Walks. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2020	J	`jnl`	Sorting with forbidden intermediates. Discret. Appl. Math. Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2019	J	`jnl`	An Optimal ACM Trans. Algorithms Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
2019	—	`conf`	Complexity of Weak, Strong and Dynamic Controllability of CNCUs. OVERLAY@AI*IA Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
2019	J	`jnl`	Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. Theor. Comput. Sci. Massimo Cairo, Romeo Rizzi
2019	J	`jnl`	Faster FPTASes for counting and random generation of Knapsack solutions. Inf. Comput. Romeo Rizzi, Alexandru I. Tomescu
2019	J	`jnl`	Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela
2019	C	`conf`	Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions. TIME Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò
2019	J	`jnl`	MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu
2019	—	`conf`	Strong Controllability of Temporal Networks with Decisions. OVERLAY@AI*IA Matteo Zavatteri, Romeo Rizzi, Tiziano Villa
2019	—	`conf`	When a Dollar Makes a BWT. ICTCS Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi
2019	J	`jnl`	When a Dollar Makes a BWT. CoRR Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi
2018	J	`jnl`	An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Algorithmica Carlo Comin, Romeo Rizzi
2018	J	`jnl`	Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm. Inf. Comput. Carlo Comin, Romeo Rizzi
2018	J	`jnl`	Efficient enumeration of graph orientations with sources. Discret. Appl. Math. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2018	C	`conf`	Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME Massimo Cairo, Luke Hunsberger, Romeo Rizzi
2018	B	`conf`	Listing Subgraphs by Cartesian Decomposition. MFCS Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2018	J	`jnl`	Network Synthesis for Distributed Embedded Systems. IEEE Trans. Computers Enrico Fraccaroli, Francesco Stefanni, Romeo Rizzi, Davide Quaglia, Franco Fummi
2018	C	`conf`	On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. TIME Carlo Comin, Romeo Rizzi
2018	J	`jnl`	On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. CoRR Carlo Comin, Romeo Rizzi
2018	C	`conf`	Pattern Matching for k-Track Permutations. IWOCA Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
2018	J	`jnl`	Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2018	—	`ch.`	Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data. Handbook of Approximation Algorithms and Metaheuristics (2) Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
2018	B	`conf`	Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
2017	C	`conf`	A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME Massimo Cairo, Luke Hunsberger, Roberto Posenato, Romeo Rizzi
2017	C	`conf`	Dynamic Controllability Made Simple. TIME Massimo Cairo, Romeo Rizzi
2017	J	`jnl`	Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games. Constraints An Int. J. Carlo Comin, Roberto Posenato, Romeo Rizzi
2017	J	`jnl`	Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. Algorithmica Carlo Comin, Romeo Rizzi
2017	C	`conf`	Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri
2017	B	`conf`	On Bubble Generators in Directed Graphs. WG Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
2017	B	`conf`	Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
2017	J	`jnl`	Solving the train marshalling problem by inclusion-exclusion. Discret. Appl. Math. Franca Rinaldi, Romeo Rizzi
2017	A*	`conf`	The Complexity of Simulation and Matrix Multiplication. SODA Massimo Cairo, Romeo Rizzi
2017	B	`conf`	The Minimum Conflict-Free Row Split Problem Revisited. WG Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2017	J	`jnl`	The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2016	J	`jnl`	Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games). CoRR Carlo Comin, Romeo Rizzi
2016	J	`jnl`	Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm). CoRR Carlo Comin, Romeo Rizzi
2016	A*	`conf`	Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI Massimo Cairo, Gabriele Farina, Romeo Rizzi
2016	Misc	`conf`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Diploid Alignment is NP-hard. CoRR Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela
2016	C	`conf`	Directing Road Networks by Listing Strong Orientations. IWOCA Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2016	C	`conf`	Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. TIME Massimo Cairo, Romeo Rizzi
2016	J	`jnl`	Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete. CoRR Massimo Cairo, Romeo Rizzi
2016	J	`jnl`	Faster O(\|V\|^2\|E\|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games. CoRR Carlo Comin, Romeo Rizzi
2016	C	`conf`	Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME Massimo Cairo, Carlo Comin, Romeo Rizzi
2016	J	`jnl`	Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. CoRR Massimo Cairo, Carlo Comin, Romeo Rizzi
2016	B	`conf`	Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2016	—	`conf`	Minimal Multiset Grammars for Recurrent Dynamics. Int. Conf. on Membrane Computing Alessandro Farinelli, Giuditta Franco, Romeo Rizzi
2016	A*	`conf`	New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA Massimo Cairo, Roberto Grossi, Romeo Rizzi
2016	J	`jnl`	On the Complexity of Computing the Excessive [ J. Graph Theory David Cariolaro, Romeo Rizzi
2016	—	`conf`	On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. BIOINFORMATICS Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu
2016	C	`conf`	Pattern Matching for Separable Permutations. SPIRE Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2016	J	`jnl`	Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2016	J	`jnl`	Sorting With Forbidden Intermediates. CoRR Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2016	—	`conf`	Sorting with Forbidden Intermediates. AlCoB Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2016	J	`jnl`	Strong cliques and equistability of EPT graphs. Discret. Appl. Math. Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi
2016	J	`jnl`	The Complexity of Simulation and (Exotic) Matrix Multiplications. CoRR Massimo Cairo, Romeo Rizzi
2015	J	`jnl`	An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. CoRR Carlo Comin, Romeo Rizzi
2015	J	`jnl`	An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. CoRR Carlo Comin, Romeo Rizzi
2015	J	`jnl`	Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. CoRR Massimo Cairo, Gabriele Farina, Romeo Rizzi
2015	C	`conf`	Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking. TIME Carlo Comin, Romeo Rizzi
2015	J	`jnl`	Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking. CoRR Carlo Comin, Romeo Rizzi
2015	C	`conf`	Enumerating Cyclic Orientations of a Graph. IWOCA Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2015	J	`jnl`	Enumerating Cyclic Orientations of a Graph. CoRR Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2015	J	`jnl`	Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen
2015	J	`jnl`	Friendly bin packing instances without Integer Round-up Property. Math. Program. Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Romeo Rizzi
2015	J	`jnl`	Hyper Temporal Networks. CoRR Carlo Comin, Roberto Posenato, Romeo Rizzi
2015	J	`jnl`	On the complexity of the vector connectivity problem. Theor. Comput. Sci. Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2015	J	`jnl`	Pattern matching in $(213, 231)$-avoiding permutations. CoRR Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2015	J	`jnl`	Some Results on More Flexible Versions of Graph Motif. Theory Comput. Syst. Romeo Rizzi, Florian Sikora
2015	J	`jnl`	Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2015	C	`conf`	The Price of Evolution in Temporal Databases. TIME Carlo Combi, Romeo Rizzi, Pietro Sala
2015	J	`jnl`	The complexity of power indexes with graph restricted coalitions. Math. Soc. Sci. Stefano Benati, Romeo Rizzi, Craig A. Tovey
2014	C	`conf`	A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games. TIME Carlo Comin, Roberto Posenato, Romeo Rizzi
2014	A	`conf`	Amortized Õ(\|V\|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014	J	`jnl`	Amortized Õ(\|V\|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014	J	`jnl`	Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
2014	J	`jnl`	Dominating sequences in graphs. Discret. Math. Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi
2014	C	`conf`	Efficiently Listing Bounded Length st-Paths. IWOCA Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014	J	`jnl`	Efficiently listing bounded length st-paths. CoRR Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014	A	`conf`	Faster FPTASes for Counting and Random Generation of Knapsack Solutions. ESA Romeo Rizzi, Alexandru I. Tomescu
2014	—	`conf`	Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems. TGC Giorgio Bacci, Marino Miculan, Romeo Rizzi
2014	J	`jnl`	Odd 2-factored snarks. Eur. J. Comb. Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan
2014	J	`jnl`	On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. BMC Bioinform. Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen
2014	J	`jnl`	On the complexity of the vector connectivity problem. CoRR Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2014	J	`jnl`	Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. Algorithmica Romeo Rizzi, David Cariolaro
2014	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2014	B	`conf`	Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette
2013	C	`conf`	A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. WABI Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	J	`jnl`	A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. CoRR Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	J	`jnl`	A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinform. Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	J	`jnl`	Floating-point arithmetic for approximate counting and random generation problems. CoRR Romeo Rizzi, Alexandru I. Tomescu
2013	J	`jnl`	Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs CoRR Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013	C	`conf`	Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013	J	`jnl`	Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2013	Misc	`conf`	On Recognizing Words That Are Squares for the Shuffle Product. CSR Romeo Rizzi, Stéphane Vialette
2013	C	`conf`	Optimal Design of Consistent Simple Temporal Networks. TIME Romeo Rizzi, Roberto Posenato
2013	A*	`conf`	Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto
2013	J	`jnl`	Ranking, unranking and random generation of extensional acyclic digraphs. Inf. Process. Lett. Romeo Rizzi, Alexandru I. Tomescu
2012	J	`jnl`	A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2012	B	`conf`	Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2012	C	`conf`	An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru
2012	B	`conf`	Complexity Insights of the Minimum Duplication Problem. SOFSEM Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
2012	J	`jnl`	Odd 2-factored snarks CoRR Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan
2012	J	`jnl`	Optimal Listing of Cycles and st-Paths in Undirected Graphs CoRR Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems CoRR Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2012	Misc	`conf`	Some Results on more Flexible Versions of Graph Motif. CSR Romeo Rizzi, Florian Sikora
2012	J	`jnl`	Some results on more flexible versions of Graph Motif CoRR Romeo Rizzi, Florian Sikora
2011	Misc	`conf`	A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2011	J	`jnl`	Approximation of RNA multiple structural alignment. J. Discrete Algorithms Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2011	—	`conf`	Minimum Mosaic Inference of a Set of Recombinants. CATS Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2011	C	`conf`	On cycle bases with limited edge overlap. CTW Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
2011	J	`jnl`	On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi
2011	A	`conf`	Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA Rui A. Ferreira, Roberto Grossi, Romeo Rizzi
2010	C	`conf`	A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2010	J	`jnl`	Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
2010	B	`conf`	Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
2010	J	`jnl`	Excessive factorizations of bipartite multigraphs. Discret. Appl. Math. David Cariolaro, Romeo Rizzi
2010	J	`jnl`	Finding common structured patterns in linear graphs. Theor. Comput. Sci. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2010	J	`jnl`	Pure Parsimony Xor Haplotyping CoRR Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi
2010	J	`jnl`	Pure Parsimony Xor Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi
2010	Misc	`conf`	Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. PSC Giuseppe Lancia, Romeo Rizzi, Russell Schwartz
2009	J	`jnl`	Approximating the maximum 3-edge-colorable subgraph problem. Discret. Math. Romeo Rizzi
2009	A	`conf`	Breaking the O(m ESA Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
2009	J	`jnl`	Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig
2009	J	`jnl`	Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2009	J	`jnl`	Lower bounds for strictly fundamental cycle bases in grid graphs. Networks Ekkehard Köhler, Christian Liebchen, Gregor Wünsch, Romeo Rizzi
2009	J	`jnl`	Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. Discret. Math. Algorithms Appl. Péter Biró, David F. Manlove, Romeo Rizzi
2009	J	`jnl`	Minimum Weakly Fundamental Cycle Bases Are Hard To Find. Algorithmica Romeo Rizzi
2009	J	`jnl`	Optimal receiver scheduling algorithms for a multicast problem. Discret. Appl. Math. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
2009	—	`conf`	Pure Parsimony Xor Haplotyping. ISBRA Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi
2009	J	`jnl`	The optimal statistical median of a convex set of arrays. J. Glob. Optim. Stefano Benati, Romeo Rizzi
2008	J	`jnl`	Flipping Letters to minimize the Support of a String. Int. J. Found. Comput. Sci. Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi
2008	J	`jnl`	Haplotyping for Disease Association: A Combinatorial Approach. IEEE ACM Trans. Comput. Biol. Bioinform. Giuseppe Lancia, R. Ravi, Romeo Rizzi
2008	J	`jnl`	On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. IEEE Trans. Mob. Comput. Reuven Cohen, Liran Katzir, Romeo Rizzi
2008	J	`jnl`	Oriented star packings. J. Comb. Theory B Richard C. Brewster, Pavol Hell, Romeo Rizzi
2008	J	`jnl`	The Minimum Substring Cover problem. Inf. Comput. Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. Eur. J. Oper. Res. Stefano Benati, Romeo Rizzi
2007	—	`conf`	Benchmarks for Strictly Fundamental Cycle Bases. WEA Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi
2007	J	`jnl`	Classes of cycle bases. Discret. Appl. Math. Christian Liebchen, Romeo Rizzi
2007	B	`conf`	Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	Least and most colored bases. Discret. Appl. Math. Francesco Maffioli, Romeo Rizzi, Stefano Benati
2007	J	`jnl`	New length bounds for cycle bases. Inf. Process. Lett. Michael Elkin, Christian Liebchen, Romeo Rizzi
2007	B	`conf`	Pattern Matching in Protein-Protein Interaction Graphs. FCT Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
2007	—	`ch.`	Scheduling Data Broadcasts on Wireless Channels. Handbook of Approximation Algorithms and Metaheuristics Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
2007	B	`conf`	The Minimum Substring Cover Problem. WAOA Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	The firefighter problem for graphs of maximum degree three. Discret. Math. Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi
2006	J	`jnl`	A polynomial case of the parsimony haplotyping problem. Oper. Res. Lett. Giuseppe Lancia, Romeo Rizzi
2006	J	`jnl`	Acyclically pushable bipartite permutation digraphs: An algorithm. Discret. Math. Romeo Rizzi
2006	B	`conf`	Approximation of RNA Multiple Structural Alignment. CPM Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2006	J	`jnl`	Covering partially directed graphs with directed paths. Discret. Math. Romeo Rizzi, Marco Rospocher
2006	Misc	`conf`	Flipping letters to minimize the support of a string. PSC Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi
2006	Misc	`conf`	Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2006	J	`jnl`	Hypercube Computations on Partitioned Optical Passive Stars Networks. IEEE Trans. Parallel Distributed Syst. Alessandro Mei, Romeo Rizzi
2006	A*	`conf`	On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. INFOCOM Reuven Cohen, Romeo Rizzi
2006	J	`jnl`	Online Permutation Routing in Partitioned Optical Passive Star Networks. IEEE Trans. Computers Alessandro Mei, Romeo Rizzi
2006	J	`jnl`	The approximability of the String Barcoding problem. Algorithms Mol. Biol. Giuseppe Lancia, Romeo Rizzi
2005	J	`jnl`	A greedy approach to compute a minimum cycle basis of a directed graph. Inf. Process. Lett. Christian Liebchen, Romeo Rizzi
2005	Misc	`conf`	Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON Guillaume Blin, Romeo Rizzi
2005	J	`jnl`	Evaluation of BIC-based algorithms for audio segmentation. Comput. Speech Lang. Mauro Cettolo, Michele Vescovi, Romeo Rizzi
2005	B	`conf`	Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	J	`jnl`	More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. J. Comput. Biol. Zhi-Zhong Chen, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu, Tao Jiang
2005	J	`jnl`	Online Permutation Routing in Partitioned Optical Passive Star Networks CoRR Alessandro Mei, Romeo Rizzi
2005	J	`jnl`	Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel. IEEE Trans. Computers Elia Ardizzoni, Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka
2005	J	`jnl`	Polynomial and APX-hard cases of the individual haplotyping problem. Theor. Comput. Sci. Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi
2005	—	`conf`	The String Barcoding Problem is NP-Hard. Comparative Genomics Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi
2005	Misc	`conf`	What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	J	`jnl`	What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Comp. Sys. Biology Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2004	J	`jnl`	Allocating servers in infostations for bounded simultaneous requests. J. Parallel Distributed Comput. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
2004	J	`jnl`	Channel assignment for interference avoidance in honeycomb wireless networks. J. Parallel Distributed Comput. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
2004	J	`jnl`	Combinatorial optimization - Polyhedra and efficiency: A book review. 4OR Michelangelo Conforti, Romeo Rizzi
2004	J	`jnl`	Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. INFORMS J. Comput. Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi
2004	J	`jnl`	On Networks Alberto Caprara, Andrea Lodi, Romeo Rizzi
2004	A	`conf`	Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. IPDPS Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka
2004	J	`jnl`	Packing cuts in undirected graphs. Networks Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
2003	A	`conf`	A DP algorithm for speaker change detection. INTERSPEECH Michele Vescovi, Mauro Cettolo, Romeo Rizzi
2003	J	`jnl`	A simple minimum T-cut algorithm. Discret. Appl. Math. Romeo Rizzi
2003	A	`conf`	Allocating Servers in Infostations for On-Demand Communications. IPDPS Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
2003	—	`conf`	Channel Assignment in Honeycomb Networks. ICTCS Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
2003	A	`conf`	Channel Assignment on Strongly-Simplicial Graphs. IPDPS Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
2003	Misc	`conf`	Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. HiPC Alessandro Mei, Romeo Rizzi
2003	A	`conf`	More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu
2003	J	`jnl`	On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. Inf. Process. Lett. Romeo Rizzi
2003	J	`jnl`	On the complexity of digraph packings. Inf. Process. Lett. Richard C. Brewster, Romeo Rizzi
2003	J	`jnl`	Packing cycles in undirected graphs. J. Algorithms Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
2003	J	`jnl`	Packing paths in digraphs. J. Graph Theory Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo
2003	J	`jnl`	Routing permutations in Partitioned Optical Passive Stars Networks. J. Parallel Distributed Comput. Alessandro Mei, Romeo Rizzi
2002	J	`jnl`	Cycle cover property and CPP=SCC property are not equivalent. Discret. Math. Romeo Rizzi
2002	J	`jnl`	Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. SIAM J. Discret. Math. Romeo Rizzi
2002	J	`jnl`	Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. Alberto Caprara, Romeo Rizzi
2002	J	`jnl`	Minimum Discret. Math. Romeo Rizzi
2002	J	`jnl`	Packing triangles in bounded degree graphs. Inf. Process. Lett. Alberto Caprara, Romeo Rizzi
2002	C	`conf`	Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. WABI Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia
2002	A	`conf`	Routing Permutations in Partitioned Optical Passive Star Networks. IPDPS Alessandro Mei, Romeo Rizzi
2001	J	`jnl`	Complexity of Context-Free Grammars with Exceptions and the Inadequacy of Grammars as Models for XML and SGML. Markup Lang. Romeo Rizzi
2001	J	`jnl`	Excluding a Simple Good Pair Approach to Directed Cuts. Graphs Comb. Romeo Rizzi
2001	J	`jnl`	On 4-connected graphs without even cycle decompositions. Discret. Math. Romeo Rizzi
2001	J	`jnl`	On the recognition of Discret. Math. Romeo Rizzi
2001	A	`conf`	Packing Cycles and Cuts in Undirected Graphs. ESA Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
2001	J	`jnl`	Routing Permutations in Partitioned Optical Passive Star Networks CoRR Alessandro Mei, Romeo Rizzi
2001	J	`jnl`	Shortest paths in conservative graphs. Discret. Math. Michele Conforti, Romeo Rizzi
2001	J	`jnl`	Some simple distributed algorithms for sparse networks. Distributed Comput. Alessandro Panconesi, Romeo Rizzi
2000	J	`jnl`	A Note on Range-Restricted Circuit Covers. Graphs Comb. Romeo Rizzi
2000	J	`jnl`	A short proof of König's matching theorem. J. Graph Theory Romeo Rizzi
2000	J	`jnl`	Edge-Coloring Bipartite Graphs. J. Algorithms Ajai Kapoor, Romeo Rizzi
2000	J	`jnl`	NOTE - On Minimizing Symmetric Set Functions. Comb. Romeo Rizzi
1999	J	`jnl`	Indecomposable J. Graph Theory Romeo Rizzi
1998	J	`jnl`	Improving a Family of Approximation Algorithms to Edge Color Multigraphs. Inf. Process. Lett. Alberto Caprara, Romeo Rizzi
1998	J	`jnl`	König's edge coloring theorem without augmenting paths. J. Graph Theory Romeo Rizzi
1997	—	`conf`	Randomized greedy algorithms for the hypergraph partitioning problem. Randomization Methods in Algorithm Design Roberto Battiti, Alan A. Bertossi, Romeo Rizzi