default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomeo Rizzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j120]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
, Stéphane Vialette:
Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. 360: 258-274 (2025)- 2024
- [j119]Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi:
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86(1): 194-217 (2024) - [j118]Alice Raffaele, Romeo Rizzi, Takeaki Uno:
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348: 105-121 (2024) - [j117]Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala:
Predictive mining of multi-temporal relations. Inf. Comput. 301: 105228 (2024) - [j116]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ACM Trans. Algorithms 20(1): 4:1-4:26 (2024) - [j115]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024) - [c93]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS 2024: 12:1-12:15 - [c92]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: 14:1-14:19 - [i46]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' characterization of unit interval graphs. CoRR abs/2404.17872 (2024) - 2023
- [j114]Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi:
An interdisciplinary experimental evaluation on the disjunctive temporal problem. Constraints An Int. J. 28(1): 1-12 (2023) - [j113]Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17(8): 1873-1888 (2023) - [j112]Romeo Rizzi, Stéphane Vialette:
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956: 111156 (2023) - [c91]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18 - [c90]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora:
Hardness of Balanced Mobiles. IWOCA 2023: 25-35 - [c89]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut Paths and Their Remainder Structure, with Applications. STACS 2023: 17:1-17:17 - [c88]Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala:
Discovering Predictive Dependencies on Multi-Temporal Relations. TIME 2023: 4:1-4:19 - [i45]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023) - [i44]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Quasi-kernels in split graphs. CoRR abs/2312.15519 (2023) - 2022
- [j111]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. Algorithmica 84(3): 719-741 (2022) - [j110]Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Dynamic controllability of temporal networks with instantaneous reaction. Inf. Sci. 613: 932-952 (2022) - [j109]Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - [c87]Matteo Zavatteri, Davide Bresolin, Romeo Rizzi, Tiziano Villa:
Dynamic Controllability of Temporal Networks via Supervisory Control. OVERLAY@AI*IA 2022: 27-31 - [c86]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - [c85]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA 2022: 359-376 - [c84]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382 - [i43]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - [i42]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut paths and their remainder structure, with applications. CoRR abs/2210.07530 (2022) - [i41]Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR abs/2210.11881 (2022) - [i40]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - 2021
- [j108]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. 305: 103-108 (2021) - [j107]Carlo Combi, Romeo Rizzi, Pietro Sala:
Checking Sets of Pure Evolving Association Rules. Fundam. Informaticae 178(4): 283-313 (2021) - [j106]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: 104637 (2021) - [j105]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98(4): 557-588 (2021) - [j104]Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi:
When a dollar makes a BWT. Theor. Comput. Sci. 857: 123-146 (2021) - [c83]Dario Ostuni, Alice Raffaele, Romeo Rizzi, Matteo Zavatteri:
Faster and Better Simple Temporal Problems. AAAI 2021: 11913-11920 - [c82]Dario Ostuni, Edoardo Morassutto, Romeo Rizzi:
Make your programs compete and watch them play in the Code Colosseum. CoG 2021: 1-5 - [c81]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP 2021: 43:1-43:18 - [c80]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG 2021: 257-269 - [i39]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic aspects of quasi-kernels. CoRR abs/2107.03793 (2021) - [i38]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR abs/2107.05717 (2021) - 2020
- [j103]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): 898-914 (2020) - [j102]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. Discret. Appl. Math. 279: 49-68 (2020) - [j101]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. J. Log. Algebraic Methods Program. 113: 100542 (2020) - [j100]Pietro Sala, Carlo Combi, Matteo Mantovani, Romeo Rizzi:
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases. SN Comput. Sci. 1(3): 153 (2020) - [c79]Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty. ICAPS 2020: 314-322 - [c78]Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
On the Complexity of Resource Controllability in Business Process Management. Business Process Management Workshops 2020: 168-180 - [i37]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. CoRR abs/2002.10498 (2020) - [i36]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Computing all s-t bridges and articulation points simplified. CoRR abs/2006.15024 (2020) - [i35]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. CoRR abs/2007.04726 (2020) - [i34]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR abs/2007.07575 (2020) - [i33]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR abs/2011.12635 (2020)
2010 – 2019
- 2019
- [j99]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): 769-777 (2019) - [j98]Romeo Rizzi, Alexandru I. Tomescu:
Faster FPTASes for counting and random generation of Knapsack solutions. Inf. Comput. 267: 135-144 (2019) - [j97]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019) - [j96]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela:
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 23-30 (2019) - [j95]Massimo Cairo, Romeo Rizzi:
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution. Theor. Comput. Sci. 797: 2-16 (2019) - [c77]Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Strong Controllability of Temporal Networks with Decisions. OVERLAY@AI*IA 2019: 77-82 - [c76]Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Complexity of Weak, Strong and Dynamic Controllability of CNCUs. OVERLAY@AI*IA 2019: 83-88 - [c75]Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi:
When a Dollar Makes a BWT. ICTCS 2019: 20-33 - [c74]Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò:
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions. TIME 2019: 16:1-16:17 - [i32]Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi:
When a Dollar Makes a BWT. CoRR abs/1908.09125 (2019) - 2018
- [j94]Carlo Comin, Romeo Rizzi:
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Algorithmica 80(12): 3525-3562 (2018) - [j93]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246: 22-37 (2018) - [j92]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): 348-374 (2018) - [j91]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): 20:1-20:26 (2018) - [j90]Enrico Fraccaroli, Francesco Stefanni, Romeo Rizzi, Davide Quaglia, Franco Fummi:
Network Synthesis for Distributed Embedded Systems. IEEE Trans. Computers 67(9): 1315-1330 (2018) - [c73]Laurent Bulteau, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for k-Track Permutations. IWOCA 2018: 102-114 - [c72]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16 - [c71]Massimo Cairo, Luke Hunsberger, Romeo Rizzi:
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME 2018: 8:1-8:16 - [c70]Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. TIME 2018: 10:1-10:20 - [c69]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: 100-110 - [p1]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
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) 2018 - [i31]Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. CoRR abs/1805.02183 (2018) - 2017
- [j89]Carlo Comin, Romeo Rizzi:
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. Algorithmica 77(4): 995-1021 (2017) - [j88]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): 152-190 (2017) - [j87]Franca Rinaldi, Romeo Rizzi:
Solving the train marshalling problem by inclusion-exclusion. Discret. Appl. Math. 217: 685-690 (2017) - [c68]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM 2017: 29:1-29:12 - [c67]Massimo Cairo, Romeo Rizzi:
The Complexity of Simulation and Matrix Multiplication. SODA 2017: 2203-2214 - [c66]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability Made Simple. TIME 2017: 8:1-8:16 - [c65]Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri:
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME 2017: 9:1-9:18 - [c64]Massimo Cairo, Luke Hunsberger, Roberto Posenato, Romeo Rizzi:
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME 2017: 10:1-10:19 - [c63]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: 18-31 - [c62]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The Minimum Conflict-Free Row Split Problem Revisited. WG 2017: 303-315 - [i30]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 abs/1701.05492 (2017) - 2016
- [j86]Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi:
Strong cliques and equistability of EPT graphs. Discret. Appl. Math. 203: 13-25 (2016) - [j85]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j84]David Cariolaro, Romeo Rizzi:
On the Complexity of Computing the Excessive [B]-Index of a Graph. J. Graph Theory 82(1): 65-74 (2016) - [c61]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI 2016: 1484-1490 - [c60]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with Forbidden Intermediates. AlCoB 2016: 133-144 - [c59]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: 272-277 - [c58]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON 2016: 393-404 - [c57]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. IWOCA 2016: 83-95 - [c56]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: 319-333 - [c55]Alessandro Farinelli, Giuditta Franco, Romeo Rizzi:
Minimal Multiset Grammars for Recurrent Dynamics. Int. Conf. on Membrane Computing 2016: 177-189 - [c54]Massimo Cairo, Roberto Grossi, Romeo Rizzi:
New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA 2016: 363-376 - [c53]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for Separable Permutations. SPIRE 2016: 260-272 - [c52]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME 2016: 80-89 - [c51]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete. TIME 2016: 90-99 - [i29]Carlo Comin, Romeo Rizzi:
Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm). CoRR abs/1602.06260 (2016) - [i28]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting With Forbidden Intermediates. CoRR abs/1602.06283 (2016) - [i27]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR abs/1604.08603 (2016) - [i26]Massimo Cairo, Romeo Rizzi:
The Complexity of Simulation and (Exotic) Matrix Multiplications. CoRR abs/1605.02156 (2016) - [i25]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. CoRR abs/1608.04132 (2016) - [i24]Massimo Cairo, Romeo Rizzi:
Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete. CoRR abs/1608.08545 (2016) - [i23]Carlo Comin, Romeo Rizzi:
Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games. CoRR abs/1609.01517 (2016) - [i22]Carlo Comin, Romeo Rizzi:
Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games). CoRR abs/1610.09679 (2016) - [i21]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela:
Diploid Alignment is NP-hard. CoRR abs/1611.05086 (2016) - 2015
- [j83]Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015) - [j82]Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Romeo Rizzi:
Friendly bin packing instances without Integer Round-up Property. Math. Program. 150(1): 5-17 (2015) - [j81]Stefano Benati, Romeo Rizzi, Craig A. Tovey:
The complexity of power indexes with graph restricted coalitions. Math. Soc. Sci. 76: 53-63 (2015) - [j80]Romeo Rizzi, Florian Sikora:
Some Results on More Flexible Versions of Graph Motif. Theory Comput. Syst. 56(4): 612-629 (2015) - [j79]Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen:
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1345-1354 (2015) - [j78]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. Theor. Comput. Sci. 591: 60-71 (2015) - [c50]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. IWOCA 2015: 88-99 - [c49]Carlo Comin, Romeo Rizzi:
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking. TIME 2015: 19-28 - [c48]Carlo Combi, Romeo Rizzi, Pietro Sala:
The Price of Evolution in Temporal Databases. TIME 2015: 47-58 - [i20]Carlo Comin, Roberto Posenato, Romeo Rizzi:
Hyper Temporal Networks. CoRR abs/1503.03974 (2015) - [i19]Carlo Comin, Romeo Rizzi:
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. CoRR abs/1503.04426 (2015) - [i18]Carlo Comin, Romeo Rizzi:
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking. CoRR abs/1505.00828 (2015) - [i17]Carlo Comin, Romeo Rizzi:
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. CoRR abs/1506.01082 (2015) - [i16]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. CoRR abs/1506.05977 (2015) - [i15]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern matching in $(213, 231)$-avoiding permutations. CoRR abs/1511.01770 (2015) - [i14]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. CoRR abs/1512.00077 (2015) - 2014
- [j77]Romeo Rizzi, David Cariolaro:
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. Algorithmica 69(3): 494-500 (2014) - [j76]Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen:
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. BMC Bioinform. 15(S-9): S5 (2014) - [j75]Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi:
Dominating sequences in graphs. Discret. Math. 336: 22-36 (2014) - [j74]Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan:
Odd 2-factored snarks. Eur. J. Comb. 36: 460-472 (2014) - [j73]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. 530: 66-79 (2014) - [j72]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. 547: 70-81 (2014) - [c47]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA 2014: 418-429 - [c46]Romeo Rizzi, Alexandru I. Tomescu:
Faster FPTASes for Counting and Random Generation of Knapsack Solutions. ESA 2014: 762-773 - [c45]Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Efficiently Listing Bounded Length st-Paths. IWOCA 2014: 318-329 - [c44]Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette:
Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM 2014: 138-149 - [c43]Giorgio Bacci, Marino Miculan, Romeo Rizzi:
Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems. TGC 2014: 17-33 - [c42]Carlo Comin, Roberto Posenato, Romeo Rizzi:
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games. TIME 2014: 7-16 - [i13]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR abs/1408.1265 (2014) - [i12]Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Efficiently listing bounded length st-paths. CoRR abs/1411.6852 (2014) - [i11]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. CoRR abs/1412.2559 (2014) - 2013
- [j71]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinform. 14(S-5): S15 (2013) - [j70]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. 24(1): 51-66 (2013) - [j69]Romeo Rizzi, Alexandru I. Tomescu:
Ranking, unranking and random generation of extensional acyclic digraphs. Inf. Process. Lett. 113(5-6): 183-187 (2013) - [c41]Romeo Rizzi, Stéphane Vialette:
On Recognizing Words That Are Squares for the Shuffle Product. CSR 2013: 235-245 - [c40]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896 - [c39]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [c38]Romeo Rizzi, Roberto Posenato:
Optimal Design of Consistent Simple Temporal Networks. TIME 2013: 19-25 - [c37]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. WABI 2013: 85-98 - [i10]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i9]Romeo Rizzi, Alexandru I. Tomescu:
Floating-point arithmetic for approximate counting and random generation problems. CoRR abs/1307.2347 (2013) - [i8]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. CoRR abs/1307.7811 (2013) - 2012
- [j68]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012) - [c36]Romeo Rizzi, Florian Sikora:
Some Results on more Flexible Versions of Graph Motif. CSR 2012: 278-289 - [c35]Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474 - [c34]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 - [c33]Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru:
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC 2012: 319-329 - [i7]Romeo Rizzi, Florian Sikora:
Some results on more flexible versions of Graph Motif. CoRR abs/1202.5184 (2012) - [i6]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012) - [i5]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. CoRR abs/1207.7184 (2012) - [i4]Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan:
Odd 2-factored snarks. CoRR abs/1210.8101 (2012) - 2011
- [j67]Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi:
On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. 159(4): 187-200 (2011) - [j66]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011) - [c32]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 - [c31]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi:
On cycle bases with limited edge overlap. CTW 2011: 52-55 - [c30]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR 2011: 373-384 - [c29]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi:
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA 2011: 275-286 - 2010
- [j65]David Cariolaro, Romeo Rizzi:
Excessive factorizations of bipartite multigraphs. Discret. Appl. Math. 158(16): 1760-1766 (2010) - [j64]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 598-610 (2010) - [j63]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. 411(4-5): 716-729 (2010) - [j62]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010) - [c28]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77 - [c27]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi:
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO 2010: 397-410 - [c26]Giuseppe Lancia, Romeo Rizzi, Russell Schwartz:
Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. Stringology 2010: 89-102 - [i3]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. CoRR abs/1001.1210 (2010)
2000 – 2009
- 2009
- [j61]Romeo Rizzi:
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. Algorithmica 53(3): 402-424 (2009) - [j60]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig:
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4): 199-243 (2009) - [j59]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Optimal receiver scheduling algorithms for a multicast problem. Discret. Appl. Math. 157(15): 3187-3197 (2009) - [j58]Romeo Rizzi:
Approximating the maximum 3-edge-colorable subgraph problem. Discret. Math. 309(12): 4166-4170 (2009) - [j57]Péter Biró, David F. Manlove, Romeo Rizzi:
Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. Discret. Math. Algorithms Appl. 1(4): 499-518 (2009) - [j56]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7(1): 90-101 (2009) - [j55]Stefano Benati, Romeo Rizzi:
The optimal statistical median of a convex set of arrays. J. Glob. Optim. 44(1): 79-97 (2009) - [j54]Ekkehard Köhler, Christian Liebchen, Gregor Wünsch, Romeo Rizzi:
Lower bounds for strictly fundamental cycle bases in grid graphs. Networks 53(2): 191-205 (2009) - [c25]Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi:
Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312 - [c24]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi:
Pure Parsimony Xor Haplotyping. ISBRA 2009: 186-197 - 2008
- [j53]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008) - [j52]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping Letters to minimize the Support of a String. Int. J. Found. Comput. Sci. 19(1): 5-17 (2008) - [j51]Richard C. Brewster, Pavol Hell, Romeo Rizzi:
Oriented star packings. J. Comb. Theory B 98(3): 558-576 (2008) - [j50]Giuseppe Lancia, R. Ravi, Romeo Rizzi:
Haplotyping for Disease Association: A Combinatorial Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 245-251 (2008) - [j49]Reuven Cohen, Liran Katzir, Romeo Rizzi:
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. IEEE Trans. Mob. Comput. 7(3): 346-357 (2008) - 2007
- [j48]Christian Liebchen, Romeo Rizzi:
Classes of cycle bases. Discret. Appl. Math. 155(3): 337-355 (2007) - [j47]Francesco Maffioli, Romeo Rizzi, Stefano Benati:
Least and most colored bases. Discret. Appl. Math. 155(15): 1958-1970 (2007) - [j46]Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi:
The firefighter problem for graphs of maximum degree three. Discret. Math. 307(16): 2094-2105 (2007) - [j45]Stefano Benati, Romeo Rizzi:
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. Eur. J. Oper. Res. 176(1): 423-434 (2007) - [j44]Michael Elkin, Christian Liebchen, Romeo Rizzi:
New length bounds for cycle bases. Inf. Process. Lett. 104(5): 186-193 (2007) - [j43]Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 523-534 (2007) - [c23]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - [c22]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007: 137-148 - [c21]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem. WAOA 2007: 170-183 - [c20]Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases. WEA 2007: 365-378 - [r1]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Scheduling Data Broadcasts on Wireless Channels. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j42]Giuseppe Lancia, Romeo Rizzi:
The approximability of the String Barcoding problem. Algorithms Mol. Biol. 1 (2006) - [j41]Romeo Rizzi:
Acyclically pushable bipartite permutation digraphs: An algorithm. Discret. Math. 306(12): 1177-1188 (2006) - [j40]Romeo Rizzi, Marco Rospocher:
Covering partially directed graphs with directed paths. Discret. Math. 306(13): 1390-1404 (2006) - [j39]Giuseppe Lancia, Romeo Rizzi:
A polynomial case of the parsimony haplotyping problem. Oper. Res. Lett. 34(3): 289-295 (2006) - [j38]Alessandro Mei, Romeo Rizzi:
Online Permutation Routing in Partitioned Optical Passive Star Networks. IEEE Trans. Computers 55(12): 1557-1571 (2006) - [j37]Alessandro Mei, Romeo Rizzi:
Hypercube Computations on Partitioned Optical Passive Stars Networks. IEEE Trans. Parallel Distributed Syst. 17(6): 497-507 (2006) - [c19]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA Multiple Structural Alignment. CPM 2006: 211-222 - [c18]Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) 2006: 783-790 - [c17]Reuven Cohen, Romeo Rizzi:
On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. INFOCOM 2006 - [c16]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping letters to minimize the support of a string. Stringology 2006: 9-17 - 2005
- [j36]Mauro Cettolo, Michele Vescovi, Romeo Rizzi:
Evaluation of BIC-based algorithms for audio segmentation. Comput. Speech Lang. 19(2): 147-170 (2005) - [j35]Christian Liebchen, Romeo Rizzi:
A greedy approach to compute a minimum cycle basis of a directed graph. Inf. Process. Lett. 94(3): 107-112 (2005) - [j34]Zhi-Zhong Chen, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu, Tao Jiang:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. J. Comput. Biol. 12(2): 129-146 (2005) - [j33]Elia Ardizzoni, Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka:
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel. IEEE Trans. Computers 54(5): 558-572 (2005) - [j32]Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi:
Polynomial and APX-hard cases of the individual haplotyping problem. Theor. Comput. Sci. 335(1): 109-125 (2005) - [j31]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Comp. Sys. Biology 2: 1-36 (2005) - [c15]Guillaume Blin, Romeo Rizzi:
Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON 2005: 22-31 - [c14]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868 - [c13]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339 - [c12]Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi:
The String Barcoding Problem is NP-Hard. Comparative Genomics 2005: 88-96 - [i2]Alessandro Mei, Romeo Rizzi:
Online Permutation Routing in Partitioned Optical Passive Star Networks. CoRR abs/cs/0502093 (2005) - 2004
- [j30]Michelangelo Conforti, Romeo Rizzi:
Combinatorial optimization - Polyhedra and efficiency: A book review. 4OR 2(2): 153-159 (2004) - [j29]Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi:
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. INFORMS J. Comput. 16(4): 348-359 (2004) - [j28]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta:
Allocating servers in infostations for bounded simultaneous requests. J. Parallel Distributed Comput. 64(10): 1113-1126 (2004) - [j27]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende:
Channel assignment for interference avoidance in honeycomb wireless networks. J. Parallel Distributed Comput. 64(12): 1329-1344 (2004) - [j26]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004) - [j25]Alberto Caprara, Andrea Lodi, Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004) - [c11]Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka:
Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. IPDPS 2004 - 2003
- [j24]Romeo Rizzi:
A simple minimum T-cut algorithm. Discret. Appl. Math. 129(2-3): 539-544 (2003) - [j23]Richard C. Brewster, Romeo Rizzi:
On the complexity of digraph packings. Inf. Process. Lett. 86(2): 101-106 (2003) - [j22]Romeo Rizzi:
On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. Inf. Process. Lett. 86(6): 335-338 (2003) - [j21]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003) - [j20]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo:
Packing paths in digraphs. J. Graph Theory 44(2): 81-94 (2003) - [j19]Alessandro Mei, Romeo Rizzi:
Routing permutations in Partitioned Optical Passive Stars Networks. J. Parallel Distributed Comput. 63(9): 847-852 (2003) - [c10]Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA 2003: 580-592 - [c9]Alessandro Mei, Romeo Rizzi:
Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. HiPC 2003: 95-104 - [c8]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende:
Channel Assignment in Honeycomb Networks. ICTCS 2003: 150-162 - [c7]Michele Vescovi, Mauro Cettolo, Romeo Rizzi:
A DP algorithm for speaker change detection. INTERSPEECH 2003: 2997-3000 - [c6]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta:
Allocating Servers in Infostations for On-Demand Communications. IPDPS 2003: 24 - [c5]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Channel Assignment on Strongly-Simplicial Graphs. IPDPS 2003: 222 - 2002
- [j18]Romeo Rizzi:
Minimum T-cuts and optimal T-pairings. Discret. Math. 257(1): 177-181 (2002) - [j17]Romeo Rizzi:
Cycle cover property and CPP=SCC property are not equivalent. Discret. Math. 259(1-3): 337-342 (2002) - [j16]Alberto Caprara, Romeo Rizzi:
Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4): 175-180 (2002) - [j15]Alberto Caprara, Romeo Rizzi:
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 6(2): 157-182 (2002) - [j14]Romeo Rizzi:
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. SIAM J. Discret. Math. 15(3): 283-288 (2002) - [c4]Alessandro Mei, Romeo Rizzi:
Routing Permutations in Partitioned Optical Passive Star Networks. IPDPS 2002 - [c3]Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia:
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. WABI 2002: 29-43 - 2001
- [j13]Alessandro Panconesi, Romeo Rizzi:
Some simple distributed algorithms for sparse networks. Distributed Comput. 14(2): 97-100 (2001) - [j12]Michele Conforti, Romeo Rizzi:
Shortest paths in conservative graphs. Discret. Math. 226(1-3): 143-153 (2001) - [j11]Romeo Rizzi:
On 4-connected graphs without even cycle decompositions. Discret. Math. 234(1-3): 181-186 (2001) - [j10]Romeo Rizzi:
On the recognition of P4-indifferent graphs. Discret. Math. 239(1-3): 161-169 (2001) - [j9]Romeo Rizzi:
Excluding a Simple Good Pair Approach to Directed Cuts. Graphs Comb. 17(4): 741-744 (2001) - [j8]Romeo Rizzi:
Complexity of Context-Free Grammars with Exceptions and the Inadequacy of Grammars as Models for XML and SGML. Markup Lang. 3(1): 107-116 (2001) - [c2]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing Cycles and Cuts in Undirected Graphs. ESA 2001: 512-523 - [i1]Alessandro Mei, Romeo Rizzi:
Routing Permutations in Partitioned Optical Passive Star Networks. CoRR cs.DC/0109027 (2001) - 2000
- [j7]Romeo Rizzi:
NOTE - On Minimizing Symmetric Set Functions. Comb. 20(3): 445-450 (2000) - [j6]Romeo Rizzi:
A Note on Range-Restricted Circuit Covers. Graphs Comb. 16(3): 355-358 (2000) - [j5]Ajai Kapoor, Romeo Rizzi:
Edge-Coloring Bipartite Graphs. J. Algorithms 34(2): 390-396 (2000) - [j4]Romeo Rizzi:
A short proof of König's matching theorem. J. Graph Theory 33(3): 138-139 (2000)
1990 – 1999
- 1999
- [j3]Romeo Rizzi:
Indecomposable r-graphs and some other counterexamples. J. Graph Theory 32(1): 1-15 (1999) - 1998
- [j2]Alberto Caprara, Romeo Rizzi:
Improving a Family of Approximation Algorithms to Edge Color Multigraphs. Inf. Process. Lett. 68(1): 11-15 (1998) - [j1]Romeo Rizzi:
König's edge coloring theorem without augmenting paths. J. Graph Theory 29(2): 87 (1998) - 1997
- [c1]Roberto Battiti, Alan A. Bertossi, Romeo Rizzi:
Randomized greedy algorithms for the hypergraph partitioning problem. Randomization Methods in Algorithm Design 1997: 21-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
