Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Romeo Rizzi
2010 – today
- 2013
[j69]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen: A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinformatics 14(S-5): S15 (2013)- [j68]Romeo Rizzi, Alexandru I. Tomescu: Ranking, unranking and random generation of extensional acyclic digraphs. Inf. Process. Lett. 113(5-6): 183-187 (2013)
- [c37]Romeo Rizzi, Stéphane Vialette: On Recognizing Words That Are Squares for the Shuffle Product. CSR 2013: 235-245
- [c36]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
- [i8]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)
- 2012
- [j67]Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012)
- [c35]Romeo Rizzi, Florian Sikora: Some Results on more Flexible Versions of Graph Motif. CSR 2012: 278-289
- [c34]Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474
- [c33]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora: Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164
- [c32]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]Marien Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan: Odd 2-factored snarks. CoRR abs/1210.8101 (2012)
- 2011
- [j66]Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi: On the approximability of the minimum strictly fundamental cycle basis problem. Discrete Applied Mathematics 159(4): 187-200 (2011)
- [j65]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen: Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011)
- [c31]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30
- [c30]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi: On cycle bases with limited edge overlap. CTW 2011: 52-55
- [c29]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
- [c28]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi: Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA 2011: 275-286
- 2010
- [j64]David Cariolaro, Romeo Rizzi: Excessive factorizations of bipartite multigraphs. Discrete Applied Mathematics 158(16): 1760-1766 (2010)
- [j63]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi: Pure Parsimony Xor Haplotyping. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 598-610 (2010)
- [j62]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette: Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. 411(4-5): 716-729 (2010)
- [j61]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)
- [c27]Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77
- [c26]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi: Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO 2010: 397-410
- [c25]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
- [j60]Romeo Rizzi: Minimum Weakly Fundamental Cycle Bases Are Hard To Find. Algorithmica 53(3): 402-424 (2009)
- [j59]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4): 199-243 (2009)
- [j58]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi: Optimal receiver scheduling algorithms for a multicast problem. Discrete Applied Mathematics 157(15): 3187-3197 (2009)
- [j57]Romeo Rizzi: Approximating the maximum 3-edge-colorable subgraph problem. Discrete Mathematics 309(12): 4166-4170 (2009)
- [j56]Péter Biró, David Manlove, Romeo Rizzi: Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. Discrete Math., Alg. and Appl. 1(4): 499-518 (2009)
- [j55]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)
- [j54]Stefano Benati, Romeo Rizzi: The optimal statistical median of a convex set of arrays. J. Global Optimization 44(1): 79-97 (2009)
- [j53]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)
- [c24]Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi: Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312
- [c23]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi: Pure Parsimony Xor Haplotyping. ISBRA 2009: 186-197
- 2008
- [j52]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008)
- [j51]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)
- [j50]Richard C. Brewster, Pavol Hell, Romeo Rizzi: Oriented star packings. J. Comb. Theory, Ser. B 98(3): 558-576 (2008)
- [j49]Giuseppe Lancia, R. Ravi, Romeo Rizzi: Haplotyping for Disease Association: A Combinatorial Approach. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008)
- [j48]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
- [j47]Christian Liebchen, Romeo Rizzi: Classes of cycle bases. Discrete Applied Mathematics 155(3): 337-355 (2007)
- [j46]Francesco Maffioli, Romeo Rizzi, Stefano Benati: Least and most colored bases. Discrete Applied Mathematics 155(15): 1958-1970 (2007)
- [j45]Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi: The firefighter problem for graphs of maximum degree three. Discrete Mathematics 307(16): 2094-2105 (2007)
- [j44]Stefano Benati, Romeo Rizzi: A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. European Journal of Operational Research 176(1): 423-434 (2007)
- [j43]Michael Elkin, Christian Liebchen, Romeo Rizzi: New length bounds for cycle bases. Inf. Process. Lett. 104(5): 186-193 (2007)
- [j42]Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 523-534 (2007)
- [c22]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252
- [c21]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette: Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007: 137-148
- [c20]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover Problem. WAOA 2007: 170-183
- [c19]Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi: Benchmarks for Strictly Fundamental Cycle Bases. WEA 2007: 365-378
- 2006
- [j41]Giuseppe Lancia, Romeo Rizzi: The approximability of the String Barcoding problem. Algorithms for Molecular Biology 1 (2006)
- [j40]Romeo Rizzi: Acyclically pushable bipartite permutation digraphs: An algorithm. Discrete Mathematics 306(12): 1177-1188 (2006)
- [j39]Romeo Rizzi, Marco Rospocher: Covering partially directed graphs with directed paths. Discrete Mathematics 306(13): 1390-1404 (2006)
- [j38]Giuseppe Lancia, Romeo Rizzi: A polynomial case of the parsimony haplotyping problem. Oper. Res. Lett. 34(3): 289-295 (2006)
- [j37]Alessandro Mei, Romeo Rizzi: Online Permutation Routing in Partitioned Optical Passive Star Networks. IEEE Trans. Computers 55(12): 1557-1571 (2006)
- [j36]Alessandro Mei, Romeo Rizzi: Hypercube Computations on Partitioned Optical Passive Stars Networks. IEEE Trans. Parallel Distrib. Syst. 17(6): 497-507 (2006)
- [c18]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen: Approximation of RNA Multiple Structural Alignment. CPM 2006: 211-222
- [c17]Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) 2006: 783-790
- [c16]Reuven Cohen, Romeo Rizzi: On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. INFOCOM 2006
- [c15]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi: Flipping letters to minimize the support of a string. Stringology 2006: 9-17
- 2005
- [j35]Mauro Cettolo, Michele Vescovi, Romeo Rizzi: Evaluation of BIC-based algorithms for audio segmentation. Computer Speech & Language 19(2): 147-170 (2005)
- [j34]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)
- [j33]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. Journal of Computational Biology 12(2): 129-146 (2005)
- [j32]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)
- [j31]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)
- [j30]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? T. Comp. Sys. Biology 2: 1-36 (2005)
- [c14]Guillaume Blin, Romeo Rizzi: Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON 2005: 22-31
- [c13]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
- [c12]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339
- [c11]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
- [j29]Michelangelo Conforti, Romeo Rizzi: Combinatorial optimization - Polyhedra and efficiency: A book review. 4OR 2(2): 153-159 (2004)
- [j28]Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. INFORMS Journal on Computing 16(4): 348-359 (2004)
- [j27]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta: Allocating servers in infostations for bounded simultaneous requests. J. Parallel Distrib. Comput. 64(10): 1113-1126 (2004)
- [j26]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende: Channel assignment for interference avoidance in honeycomb wireless networks. J. Parallel Distrib. Comput. 64(12): 1329-1344 (2004)
- [j25]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004)
- [j24]Alberto Caprara, Andrea Lodi, Romeo Rizzi: On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004)
- [c10]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
- [j23]Romeo Rizzi: A simple minimum T-cut algorithm. Discrete Applied Mathematics 129(2-3): 539-544 (2003)
- [j22]Richard C. Brewster, Romeo Rizzi: On the complexity of digraph packings. Inf. Process. Lett. 86(2): 101-106 (2003)
- [j21]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)
- [j20]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi: Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003)
- [j19]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo: Packing paths in digraphs. Journal of Graph Theory 44(2): 81-94 (2003)
- [j18]Alessandro Mei, Romeo Rizzi: Routing permutations in Partitioned Optical Passive Stars Networks. J. Parallel Distrib. Comput. 63(9): 847-852 (2003)
- [c9]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
- [c8]Alessandro Mei, Romeo Rizzi: Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. HiPC 2003: 95-104
- [c7]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende: Channel Assignment in Honeycomb Networks. ICTCS 2003: 150-162
- [c6]Michele Vescovi, Mauro Cettolo, Romeo Rizzi: A DP algorithm for speaker change detection. INTERSPEECH 2003
- [c5]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta: Allocating Servers in Infostations for On-Demand Communications. IPDPS 2003: 24
- [c4]Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi: Channel Assignment on Strongly-Simplicial Graphs. IPDPS 2003: 222
- 2002
- [j17]
- [j16]Romeo Rizzi: Cycle cover property and CPP=SCC property are not equivalent. Discrete Mathematics 259(1-3): 337-342 (2002)
- [j15]Alberto Caprara, Romeo Rizzi: Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4): 175-180 (2002)
- [j14]Alberto Caprara, Romeo Rizzi: Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 6(2): 157-182 (2002)
- [j13]Romeo Rizzi: Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. SIAM J. Discrete Math. 15(3): 283-288 (2002)
- [c3]Alessandro Mei, Romeo Rizzi: Routing Permutations in Partitioned Optical Passive Star Networks. IPDPS 2002
- [c2]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
- [j12]Alessandro Panconesi, Romeo Rizzi: Some simple distributed algorithms for sparse networks. Distributed Computing 14(2): 97-100 (2001)
- [j11]Michele Conforti, Romeo Rizzi: Shortest paths in conservative graphs. Discrete Mathematics 226(1-3): 143-153 (2001)
- [j10]Romeo Rizzi: On 4-connected graphs without even cycle decompositions. Discrete Mathematics 234(1-3): 181-186 (2001)
- [j9]Romeo Rizzi: On the recognition of P4-indifferent graphs. Discrete Mathematics 239(1-3): 161-169 (2001)
- [j8]Romeo Rizzi: Excluding a Simple Good Pair Approach to Directed Cuts. Graphs and Combinatorics 17(4): 741-744 (2001)
- [c1]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]
- [j6]Romeo Rizzi: A Note on Range-Restricted Circuit Covers. Graphs and Combinatorics 16(3): 355-358 (2000)
- [j5]
- [j4]Romeo Rizzi: A short proof of König's matching theorem. Journal of Graph Theory 33(3): 138-139 (2000)
1990 – 1999
- 1999
- [j3]Romeo Rizzi: Indecomposable r-graphs and some other counterexamples. Journal of 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. Journal of Graph Theory 29(2): 87 (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:37 CEST by the dblp team