SCIENTIFIC PUBLICATIONS
RIZZI ROMEO
(december 2003)

• (PS,   PDF) ALESSANDRO MEI, ROMEO RIZZI,
  Routing Permutations in Partitioned Optical Passive Stars Networks,
  Journal of Parallel and Distributed Computing 63 (9) (2003) 847-852.
  - also accepted at IPDPS 2002 where it received the Best Paper Award.

  
  

• (PS,   PDF) ALBERTO CAPRARA, ALESSANDRO PANCONESI, ROMEO RIZZI,
  Packing Cycles in Undirected Graphs,
  Journal of Algorithms 48 (2003) 239-256.
  - part of this work was published in the proceedings of ESA 2001.
  - almost in full also in: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001).

  
  

• (PS,   PDF) ROMEO RIZZI,
  A Simple Minimum $T$-Cut Algorithm,
  Discrete Applied Mathematics 129 (2003) 539-544.

  
  

• (PS,   PDF) RICHARD C. BREWSTER, ROMEO RIZZI,
  On the complexity of digraph packings,
  Information Processing Letters 86 (2) (2003) 101-106.

  
  

• (PS,   PDF) ROMEO RIZZI,
  On Rajagopalan and Vazirani's $\frac{3}{2}$-Approximation Bound for the Iterated $1$-Steiner Heuristic,
  Information Processing Letters 86 (6) (2003) 335-338.

  
  

• (PS,   PDF) RICHARD C. BREWSTER, PAVOL HELL, SARAH H. PANTEL, ROMEO RIZZI, ANDERS YEO,
  Packing paths in digraphs,
  Journal of Graph Theory 44 (2) (2003) 81-94.

  
  

• (PS,   PDF) ALBERTO CAPRARA, ROMEO RIZZI,
  Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals,
  Journal of Combinatorial Optimization 6 (2002) 157-182.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Finding $1$-factors in bipartite regular graphs, and edge-coloring bipartite graphs,
  SIAM Journal on Discrete Mathematics 15 (3) (2002) 283-288.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Minimum $T$-cuts and optimal $T$-pairings,
  Discrete Mathematics 257 (1) (2002) 177-181.

  
  

• (PS,   PDF) ALBERTO CAPRARA, ROMEO RIZZI,
  Packing Triangles in Bounded Degree Graphs,
  Inf. Proc. Lett. 84 (2002) 175-180.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Cycle cover property and $CPP=SCC$ property are not equivalent,
  Discrete Mathematics 259 (2002) 337-342.

  
  

• (PS,   PDF) MICHELE CONFORTI, ROMEO RIZZI,
  Shortest Paths in Conservative Graphs,
  Discrete Mathematics 226 (2001) 143-153.
  - part of this work was published in the proceedings of AIRO '96.

  
  

• (PS,   PDF) ROMEO RIZZI,
  On $4$-connected graphs without even cycle decompositions,
  Discrete Mathematics 234 (2001) 181-186.

  
  

• (PS,   PDF) ROMEO RIZZI,
  On the Recognition of $P_4$-Indifferent Graphs,
  Discrete Mathematics 239 (2001) 161-169.

  
  

• (PS,   PDF) ALESSANDRO PANCONESI, ROMEO RIZZI,
  Some Simple Distributed Algorithms for Sparse Networks,
  Distributed Computing 14 (2001) 97-100.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML,
  Markup Languages: Theory and Practice 3 (1) (2001) 107-116.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Excluding a simple good pair approach to directed cuts,
  Graphs and Combinatorics 17 (2001) 741-744.

  
  

• (PS,   PDF) ROMEO RIZZI,
  On minimizing symmetric set functions,
  Combinatorica 20 (3) (2000) 445-450.

  
  

• (PS,   PDF) AJAI KAPOOR, ROMEO RIZZI,
  Edge-coloring bipartite graphs,
  Journal of Algorithms 34 (2) (2000) 390-396.

  
  

• (PS,   PDF) ROMEO RIZZI,
  A short proof of Konig's matching theorem,
  Journal of Graph Theory 33 (3) (2000) 138-139.

  
  

• (PS,   PDF) ROMEO RIZZI,
  A note on range-restricted circuit covers,
  Graphs and Combinatorics 16 (2000) 355-358.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Indecomposable $r$-graphs and some other counterexamples,
  Journal of Graph Theory 32 (1) (1999) 1-15.

  
  

• (PS,   PDF) ROBERTO BATTITI, ALAN A. BERTOSSI, ROMEO RIZZI,
  Randomized Greedy Algorithms for the Hypergraph Partitioning Problem,
  Cap. 2, Vol. 43.
  Randomized Methods in Algorithm Design.
  DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
  Pardalos P., Rajasekaran S., Rolim J. (a cura di), Providence, RI: American Mathematical Society.
  1998. pp. 3-21.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Konig's Edge Coloring Theorem without augmenting paths,
  Journal of Graph Theory 29 (1998) 87.

  
  

• (PS,   PDF) ALBERTO CAPRARA, ROMEO RIZZI,
  Improving a Family of Approximation Algorithms to Edge Color Multigraphs,
  Inf. Proc. Lett. 68 (1998) 11-15.

  
  

• (PS,   PDF) ROMEO RIZZI,
  Impaccando $T$-tagli e $T$-giunti,
  Bollettino Sezione B dell'Unione Matematica Italiana,
  Fascicolo speciale dedicato alle tesi di dottorato (8) 1-A Suppl. (1998) 201-204.