| * | 2009 |
|---|
| 76 | EE | Edoardo Amaldi,
Claudio Iuliano,
Tomasz Jurkiewicz,
Kurt Mehlhorn,
Romeo Rizzi:
Breaking the O(m2n) Barrier for Minimum Cycle Bases.
ESA 2009: 301-312 |
| 75 | EE | Paola Bonizzoni,
Gianluca Della Vedova,
Riccardo Dondi,
Yuri Pirola,
Romeo Rizzi:
Pure Parsimony Xor Haplotyping.
ISBRA 2009: 186-197 |
| 74 | EE | Romeo Rizzi:
Minimum Weakly Fundamental Cycle Bases Are Hard To Find.
Algorithmica 53(3): 402-424 (2009) |
| 73 | EE | 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) |
| 72 | EE | Stefano Benati,
Romeo Rizzi:
The optimal statistical median of a convex set of arrays.
J. Global Optimization 44(1): 79-97 (2009) |
| 71 | EE | 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) |
| 2008 |
|---|
| 70 | EE | 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) |
| 69 | EE | Giuseppe Lancia,
R. Ravi,
Romeo Rizzi:
Haplotyping for Disease Association: A Combinatorial Approach.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008) |
| 68 | EE | Danny Hermelin,
Dror Rawitz,
Romeo Rizzi,
Stéphane Vialette:
The Minimum Substring Cover problem.
Inf. Comput. 206(11): 1303-1312 (2008) |
| 67 | EE | 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) |
| 66 | EE | Richard C. Brewster,
Pavol Hell,
Romeo Rizzi:
Oriented star packings.
J. Comb. Theory, Ser. B 98(3): 558-576 (2008) |
| 2007 |
|---|
| 65 | EE | Guillaume Fertin,
Danny Hermelin,
Romeo Rizzi,
Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
CPM 2007: 241-252 |
| 64 | EE | Gaëlle Brevier,
Romeo Rizzi,
Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs.
FCT 2007: 137-148 |
| 63 | EE | Danny Hermelin,
Dror Rawitz,
Romeo Rizzi,
Stéphane Vialette:
The Minimum Substring Cover Problem.
WAOA 2007: 170-183 |
| 62 | EE | Christian Liebchen,
Gregor Wünsch,
Ekkehard Köhler,
Alexander Reich,
Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases.
WEA 2007: 365-378 |
| 61 | EE | Francesco Maffioli,
Romeo Rizzi,
Stefano Benati:
Least and most colored bases.
Discrete Applied Mathematics 155(15): 1958-1970 (2007) |
| 60 | EE | Christian Liebchen,
Romeo Rizzi:
Classes of cycle bases.
Discrete Applied Mathematics 155(3): 337-355 (2007) |
| 59 | EE | Stephen Finbow,
Andrew King,
Gary MacGillivray,
Romeo Rizzi:
The firefighter problem for graphs of maximum degree three.
Discrete Mathematics 307(16): 2094-2105 (2007) |
| 58 | EE | 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) |
| 57 | EE | 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) |
| 56 | EE | Michael Elkin,
Christian Liebchen,
Romeo Rizzi:
New length bounds for cycle bases.
Inf. Process. Lett. 104(5): 186-193 (2007) |
| 2006 |
|---|
| 55 | EE | Marcin Kubica,
Romeo Rizzi,
Stéphane Vialette,
Tomasz Walen:
Approximation of RNA Multiple Structural Alignment.
CPM 2006: 211-222 |
| 54 | EE | Reuven Cohen,
Romeo Rizzi:
On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks.
INFOCOM 2006 |
| 53 | EE | 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 |
| 52 | EE | Giuseppe Lancia,
Franca Rinaldi,
Romeo Rizzi:
Flipping letters to minimize the support of a string.
Stringology 2006: 9-17 |
| 51 | EE | Giuseppe Lancia,
Romeo Rizzi:
The approximability of the String Barcoding problem.
Algorithms for Molecular Biology 1: (2006) |
| 50 | EE | Romeo Rizzi:
Acyclically pushable bipartite permutation digraphs: An algorithm.
Discrete Mathematics 306(12): 1177-1188 (2006) |
| 49 | EE | Romeo Rizzi,
Marco Rospocher:
Covering partially directed graphs with directed paths.
Discrete Mathematics 306(13): 1390-1404 (2006) |
| 48 | EE | Alessandro Mei,
Romeo Rizzi:
Online Permutation Routing in Partitioned Optical Passive Star Networks.
IEEE Trans. Computers 55(12): 1557-1571 (2006) |
| 47 | EE | Alessandro Mei,
Romeo Rizzi:
Hypercube Computations on Partitioned Optical Passive Stars Networks.
IEEE Trans. Parallel Distrib. Syst. 17(6): 497-507 (2006) |
| 46 | EE | Giuseppe Lancia,
Romeo Rizzi:
A polynomial case of the parsimony haplotyping problem.
Oper. Res. Lett. 34(3): 289-295 (2006) |
| 2005 |
|---|
| 45 | EE | Guillaume Blin,
Romeo Rizzi:
Conserved Interval Distance Computation Between Non-trivial Genomes.
COCOON 2005: 22-31 |
| 44 | EE | Marcello Dalpasso,
Giuseppe Lancia,
Romeo Rizzi:
The String Barcoding Problem is NP-Hard.
Comparative Genomics 2005: 88-96 |
| 43 | EE | 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 |
| 42 | EE | Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
MFCS 2005: 328-339 |
| 41 | EE | Alessandro Mei,
Romeo Rizzi:
Online Permutation Routing in Partitioned Optical Passive Star Networks
CoRR abs/cs/0502093: (2005) |
| 40 | EE | Mauro Cettolo,
Michele Vescovi,
Romeo Rizzi:
Evaluation of BIC-based algorithms for audio segmentation.
Computer Speech & Language 19(2): 147-170 (2005) |
| 39 | EE | 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) |
| 38 | EE | 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) |
| 37 | EE | 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) |
| 36 | EE | 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) |
| 35 | EE | 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) |
| 2004 |
|---|
| 34 | EE | 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 |
| 33 | EE | Michelangelo Conforti,
Romeo Rizzi:
Combinatorial optimization - Polyhedra and efficiency: A book review.
4OR 2(2): 153-159 (2004) |
| 32 | EE | 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) |
| 31 | EE | 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) |
| 30 | EE | 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) |
| 29 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing cuts in undirected graphs.
Networks 44(1): 1-11 (2004) |
| 28 | EE | Alberto Caprara,
Andrea Lodi,
Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing.
Networks 44(4): 266-280 (2004) |
| 2003 |
|---|
| 27 | EE | 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 |
| 26 | EE | Alessandro Mei,
Romeo Rizzi:
Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks.
HiPC 2003: 95-104 |
| 25 | EE | Alan A. Bertossi,
Maria Cristina Pinotti,
Romeo Rizzi,
Anil M. Shende:
Channel Assignment in Honeycomb Networks.
ICTCS 2003: 150-162 |
| 24 | EE | Alan A. Bertossi,
Maria Cristina Pinotti,
Romeo Rizzi:
Channel Assignment on Strongly-Simplicial Graphs.
IPDPS 2003: 222 |
| 23 | EE | Alan A. Bertossi,
Maria Cristina Pinotti,
Romeo Rizzi,
Phalguni Gupta:
Allocating Servers in Infostations for On-Demand Communications.
IPDPS 2003: 24 |
| 22 | EE | Romeo Rizzi:
A simple minimum T-cut algorithm.
Discrete Applied Mathematics 129(2-3): 539-544 (2003) |
| 21 | EE | Richard C. Brewster,
Romeo Rizzi:
On the complexity of digraph packings.
Inf. Process. Lett. 86(2): 101-106 (2003) |
| 20 | EE | 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) |
| 19 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing cycles in undirected graphs.
J. Algorithms 48(1): 239-256 (2003) |
| 18 | EE | Alessandro Mei,
Romeo Rizzi:
Routing permutations in Partitioned Optical Passive Stars Networks.
J. Parallel Distrib. Comput. 63(9): 847-852 (2003) |
| 2002 |
|---|
| 17 | EE | Alessandro Mei,
Romeo Rizzi:
Routing Permutations in Partitioned Optical Passive Star Networks.
IPDPS 2002 |
| 16 | EE | 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 |
| 15 | EE | Romeo Rizzi:
Minimum T-cuts and optimal T-pairings.
Discrete Mathematics 257(1): 177-181 (2002) |
| 14 | EE | Romeo Rizzi:
Cycle cover property and CPP=SCC property are not equivalent.
Discrete Mathematics 259(1-3): 337-342 (2002) |
| 13 | EE | Alberto Caprara,
Romeo Rizzi:
Packing triangles in bounded degree graphs.
Inf. Process. Lett. 84(4): 175-180 (2002) |
| 12 | | Alberto Caprara,
Romeo Rizzi:
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals.
J. Comb. Optim. 6(2): 157-182 (2002) |
| 11 | EE | Romeo Rizzi:
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs.
SIAM J. Discrete Math. 15(3): 283-288 (2002) |
| 2001 |
|---|
| 10 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing Cycles and Cuts in Undirected Graphs.
ESA 2001: 512-523 |
| 9 | EE | Alessandro Mei,
Romeo Rizzi:
Routing Permutations in Partitioned Optical Passive Star Networks
CoRR cs.DC/0109027: (2001) |
| 8 | EE | Michele Conforti,
Romeo Rizzi:
Shortest paths in conservative graphs.
Discrete Mathematics 226(1-3): 143-153 (2001) |
| 7 | EE | Romeo Rizzi:
On 4-connected graphs without even cycle decompositions.
Discrete Mathematics 234(1-3): 181-186 (2001) |
| 6 | EE | Romeo Rizzi:
On the recognition of P4-indifferent graphs.
Discrete Mathematics 239(1-3): 161-169 (2001) |
| 5 | EE | Alessandro Panconesi,
Romeo Rizzi:
Some simple distributed algorithms for sparse networks.
Distributed Computing 14(2): 97-100 (2001) |
| 4 | EE | Romeo Rizzi:
Excluding a Simple Good Pair Approach to Directed Cuts.
Graphs and Combinatorics 17(4): 741-744 (2001) |
| 2000 |
|---|
| 3 | EE | Romeo Rizzi:
NOTE - On Minimizing Symmetric Set Functions.
Combinatorica 20(3): 445-450 (2000) |
| 2 | | Ajai Kapoor,
Romeo Rizzi:
Edge-Coloring Bipartite Graphs.
J. Algorithms 34(2): 390-396 (2000) |
| 1998 |
|---|
| 1 | EE | Alberto Caprara,
Romeo Rizzi:
Improving a Family of Approximation Algorithms to Edge Color Multigraphs.
Inf. Process. Lett. 68(1): 11-15 (1998) |
