The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Romeo Rizzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guillaume Blin, Romeo Rizzi
    Conserved Interval Distance Computation Between Non-trivial Genomes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:22-31 [Conf]
  2. Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
    Approximation of RNA Multiple Structural Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:211-222 [Conf]
  3. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing Cycles and Cuts in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:512-523 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:580-592 [Conf]
  5. Alessandro Mei, Romeo Rizzi
    Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. [Citation Graph (0, 0)][DBLP]
    HiPC, 2003, pp:95-104 [Conf]
  6. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:860-868 [Conf]
  7. Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Genomes Containing Duplicates Are Hard to Compare. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:783-790 [Conf]
  8. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
    Channel Assignment in Honeycomb Networks. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:150-162 [Conf]
  9. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi
    Channel Assignment on Strongly-Simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:222- [Conf]
  10. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
    Allocating Servers in Infostations for On-Demand Communications. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:24- [Conf]
  11. Alan A. Bertossi, Maria Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V. S. Shashanka
    Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. Alessandro Mei, Romeo Rizzi
    Routing Permutations in Partitioned Optical Passive Star Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  13. Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:328-339 [Conf]
  14. Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi
    The String Barcoding Problem is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2005, pp:88-96 [Conf]
  15. Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi
    Flipping letters to minimize the support of a string. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:9-17 [Conf]
  16. Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia
    Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:29-43 [Conf]
  17. Michelangelo Conforti, Romeo Rizzi
    Combinatorial optimization - Polyhedra and efficiency: A book review. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:2, pp:153-159 [Journal]
  18. Romeo Rizzi
    NOTE - On Minimizing Symmetric Set Functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:445-450 [Journal]
  19. Alessandro Mei, Romeo Rizzi
    Routing Permutations in Partitioned Optical Passive Star Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  20. Romeo Rizzi
    A simple minimum T-cut algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:539-544 [Journal]
  21. Christian Liebchen, Romeo Rizzi
    Classes of cycle bases. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:337-355 [Journal]
  22. Alessandro Panconesi, Romeo Rizzi
    Some simple distributed algorithms for sparse networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:2, pp:97-100 [Journal]
  23. Michele Conforti, Romeo Rizzi
    Shortest paths in conservative graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:143-153 [Journal]
  24. Romeo Rizzi
    On the recognition of P4-indifferent graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:161-169 [Journal]
  25. Romeo Rizzi
    On 4-connected graphs without even cycle decompositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:181-186 [Journal]
  26. Romeo Rizzi
    Cycle cover property and CPP=SCC property are not equivalent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:337-342 [Journal]
  27. Romeo Rizzi
    Minimum T-cuts and optimal T-pairings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:1, pp:177-181 [Journal]
  28. Romeo Rizzi
    Acyclically pushable bipartite permutation digraphs: An algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1177-1188 [Journal]
  29. Romeo Rizzi, Marco Rospocher
    Covering partially directed graphs with directed paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1390-1404 [Journal]
  30. Romeo Rizzi
    Excluding a Simple Good Pair Approach to Directed Cuts. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:741-744 [Journal]
  31. Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi
    Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:4, pp:348-359 [Journal]
  32. Richard C. Brewster, Romeo Rizzi
    On the complexity of digraph packings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:101-106 [Journal]
  33. Alberto Caprara, Romeo Rizzi
    Packing triangles in bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:175-180 [Journal]
  34. Alberto Caprara, Romeo Rizzi
    Improving a Family of Approximation Algorithms to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:11-15 [Journal]
  35. Christian Liebchen, Romeo Rizzi
    A greedy approach to compute a minimum cycle basis of a directed graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:3, pp:107-112 [Journal]
  36. Romeo Rizzi
    On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:6, pp:335-338 [Journal]
  37. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cycles in undirected graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:239-256 [Journal]
  38. Ajai Kapoor, Romeo Rizzi
    Edge-Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:390-396 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:2, pp:129-146 [Journal]
  40. Alberto Caprara, Romeo Rizzi
    Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:2, pp:157-182 [Journal]
  41. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
    Allocating servers in infostations for bounded simultaneous requests. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:10, pp:1113-1126 [Journal]
  42. Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende
    Channel assignment for interference avoidance in honeycomb wireless networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:12, pp:1329-1344 [Journal]
  43. Alessandro Mei, Romeo Rizzi
    Routing permutations in Partitioned Optical Passive Stars Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:9, pp:847-852 [Journal]
  44. Alberto Caprara, Andrea Lodi, Romeo Rizzi
    On d-threshold graphs and d-dimensional bin packing. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:266-280 [Journal]
  45. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cuts in undirected graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:1-11 [Journal]
  46. Giuseppe Lancia, Romeo Rizzi
    A polynomial case of the parsimony haplotyping problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:289-295 [Journal]
  47. Romeo Rizzi
    Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:283-288 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:5, pp:558-572 [Journal]
  49. Alessandro Mei, Romeo Rizzi
    Online Permutation Routing in Partitioned Optical Passive Star Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:12, pp:1557-1571 [Journal]
  50. Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi
    Polynomial and APX-hard cases of the individual haplotyping problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:1, pp:109-125 [Journal]
  51. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
    T. Comp. Sys. Biology, 2005, v:2, n:, pp:1-36 [Journal]
  52. Alessandro Mei, Romeo Rizzi
    Hypercube Computations on Partitioned Optical Passive Stars Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:6, pp:497-507 [Journal]
  53. Mauro Cettolo, Michele Vescovi, Romeo Rizzi
    Evaluation of BIC-based algorithms for audio segmentation. [Citation Graph (0, 0)][DBLP]
    Computer Speech & Language, 2005, v:19, n:2, pp:147-170 [Journal]
  54. Stefano Benati, Romeo Rizzi
    A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:1, pp:423-434 [Journal]
  55. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
    Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:241-252 [Conf]
  56. Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
    Pattern Matching in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:137-148 [Conf]
  57. Reuven Cohen, Romeo Rizzi
    On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  58. Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi
    Benchmarks for Strictly Fundamental Cycle Bases. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:365-378 [Conf]
  59. Alessandro Mei, Romeo Rizzi
    Online Permutation Routing in Partitioned Optical Passive Star Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  60. Francesco Maffioli, Romeo Rizzi, Stefano Benati
    Least and most colored bases. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:15, pp:1958-1970 [Journal]
  61. Stephen Finbow, Andrew King, Gary MacGillivray, Romeo Rizzi
    The firefighter problem for graphs of maximum degree three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2094-2105 [Journal]
  62. Michael Elkin, Christian Liebchen, Romeo Rizzi
    New length bounds for cycle bases. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:186-193 [Journal]

  63. A Faster Algorithm for Finding Minimum Tucker Submatrices. [Citation Graph (, )][DBLP]


  64. Breaking the O(m2n) Barrier for Minimum Cycle Bases. [Citation Graph (, )][DBLP]


  65. Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. [Citation Graph (, )][DBLP]


  66. The Minimum Substring Cover Problem. [Citation Graph (, )][DBLP]


  67. Pure Parsimony Xor Haplotyping. [Citation Graph (, )][DBLP]


  68. Minimum Weakly Fundamental Cycle Bases Are Hard To Find. [Citation Graph (, )][DBLP]


  69. Pure Parsimony Xor Haplotyping [Citation Graph (, )][DBLP]


  70. Optimal receiver scheduling algorithms for a multicast problem. [Citation Graph (, )][DBLP]


  71. Excessive factorizations of bipartite multigraphs. [Citation Graph (, )][DBLP]


  72. Approximating the maximum 3-edge-colorable subgraph problem. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002