Research Outputs Romeo Rizzi


  • S. Benati, R. Rizzi, "The Optimal Statistical Median of a Convex Set of Arrays" in JOURNAL OF GLOBAL OPTIMIZATION, v. 44, (2009), p. 79-97 - see details
  • S. Benati, R. Rizzi, "A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem" in EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v. 176, (2007), p. 423-434 - see details
  • S. Benati, R. Rizzi, "A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem" in EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v. 176, (2007), p. 423-434 - see details
  • S. Benati, R. Rizzi, F. Maffioli, "Least and most colorable bases" in DISCRETE APPLIED MATHEMATICS, v. 155, (2007), p. 1958-1970 - see details
  • F. Maffioli, R. Rizzi, S. Benati, "Least and most colored bases" in DISCRETE APPLIED MATHEMATICS, v. 155, (2007), p. 1958-1970 - see details
  • C. Liebchen, R. Rizzi, "A greedy approach to compute a minimum cycle basis of a directed graph" in INFORMATION PROCESSING LETTERS, v. 94, n. 3 (2005), p. 107-112. - DOI: 10.1016/j.ipl.2005.01.006 - see details
  • M. Cettolo, M. Vescovi, R. Rizzi, "Evaluation of BIC-based algorithms for audio segmentation" in COMPUTER SPEECH AND LANGUAGE, v. 19, n. 2 (2005), p. 147-170 - see details
  • A. Bertossi, C. Pinotti, R. Rizzi, P. Gupta, "Allocating Servers in Infostations for Bounded Simultaneous Requests" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 64, n. 10 (2004), p. 1113-1126. - DOI: 10.1016/j.jpdc.2004.06.003 - see details
  • C. Pinotti, R. Rizzi, A. Bertossi, "Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 64, (2004), p. 1329-1344. - DOI: 10.1016/j.jpdc.2004.06.006 - see details
  • M. Conforti, R. Rizzi, "Combinatorial Optimization - Polyhedra and efficiency: A book review" in 4OR, v. 2, n. 2 (2004), p. 153-159. - DOI: 10.1007/s10288-004-0035-9 - see details
  • A. Caprara, A. Lodi, R. Rizzi, "On d-Threshold Graphs and d-Dimensional Bin Packing" in NETWORKS, v. 44, n. 4 (2004), p. 266-280. - DOI: 10.1002/net.20037 - see details
  • A. Caprara, A. Panconesi, R. Rizzi, "Packing Cuts in Graphs" in NETWORKS, v. 44, n. 1 (2004), p. 1-11 - see details
  • G. Lancia, C. Pinotti, R. Rizzi, "Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms " in INFORMS JOURNAL ON COMPUTING, v. 16, n. 4 (2004), p. 348-359. - DOI: 10.1287/ijoc.1060.0085 - see details
  • M. Vescovi, M. Cettolo, R. Rizzi, "A DP Algorithm for Speaker Change Detection" in 8th European Conference on Speech Communication and Technology : Eurospeech '03: an Interspeech event ; September 1 - 4, 2003, Geneva, Switzerland: ISCA, 2003, p. 2997-3000. Proceedings of: International Conference on Language Resources and Evaluation <4, 2004, Lisbon, Portugal, Ginevra, Switzerland, 1-4 September 2003. - URL: http://www.isca-speech.org/archive/eurospeech_2003/e03_2997.html - see details
  • R. Rizzi, "A Simple Minimum T-Cut Algorithm" in DISCRETE APPLIED MATHEMATICS, v. 129, n. 2-3 (2003), p. 539-544 - see details
  • R. Rizzi, "On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic" in INFORMATION PROCESSING LETTERS, v. 86, n. 6 (2003), p. 335-338 - see details
  • R. Brewster, R. Rizzi, "On the complexity of digraph packings" in INFORMATION PROCESSING LETTERS, v. 86, n. 2 (2003), p. 101-106 - see details
  • A. Caprara, A. Panconesi, R. Rizzi, "Packing Cycles in Undirected Graphs" in JOURNAL OF ALGORITHMS, v. 48, n. 1 (2003), p. 239-256 - see details
  • R. Brewster, P. Hell, S. Pantel, R. Rizzi, A. Yeo, "Packing paths in digraphs" in JOURNAL OF GRAPH THEORY, v. 44, n. 2 (2003), p. 81-94 - see details
  • A. Mei, R. Rizzi, "Routing permutations in partitioned optical passive stars networks" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 63, n. 9 (2003), p. 847-852 - see details
  • R. Rizzi, "Cycle cover property and CPP=SCC property are not equivalent" in DISCRETE MATHEMATICS, v. 259, (2002), p. 337-342 - see details
  • R. Rizzi, "Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs" in SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 15, n. 3 (2002), p. 283-288 - see details
  • A. Caprara, R. Rizzi, "Improveda Approximation for breakpoint graph decompositionand sorting by reversals" in JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 6, (2002), p. 157-182 - see details
  • R. Rizzi, "Minimum T-cuts and optimal T-pairings" in DISCRETE APPLIED MATHEMATICS, v. 257, n. 1 (2002), p. 177-181 - see details
  • A. Caprara, R. Rizzi, "Packing Triangles in Bounded Degree Graphs" in INFORMATION PROCESSING LETTERS, v. 84, (2002), p. 175-180 - see details
  • R. Rizzi, "Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML" in MARKUP LANGUAGES:THEORY AND PRACTICE., v. 3, n. 1 (2001), p. 107-116 - see details
  • R. Rizzi, "Excluding a simple good pair approach to directed cuts" in GRAPHS AND COMBINATORICS, v. 17, (2001), p. 741-744 - see details
  • R. Rizzi, "On 4-connected graphs without even cycle decompositions" in DISCRETE MATHEMATICS, v. 234, (2001), p. 181-186 - see details
  • R. Rizzi, "On the Recognition of $P_4$-Indifferent Graphs" in DISCRETE MATHEMATICS, v. 239, (2001), p. 161-169 - see details
  • M. Conforti, R. Rizzi, "Shortest Paths in Conservative Graphs" in DISCRETE MATHEMATICS, v. 226, (2001), p. 143-153 - see details
  • A. Panconesi, R. Rizzi, "Some simple distributed algorithms for sparse networks" in JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 14, (2001), p. 97-100 - see details
  • R. Rizzi, "A note on range-restricted circuit covers" in GRAPHS AND COMBINATORICS, v. 16, (2000), p. 355-358 - see details
  • R. Rizzi, "A short proof of Konig's matching theorem" in JOURNAL OF GRAPH THEORY, v. 33, n. 3 (2000), p. 138-139 - see details
  • A. Kapoor, R. Rizzi, "Edge-coloring bipartite graphs" in JOURNAL OF ALGORITHMS, v. 34, n. 2 (2000), p. 390-396 - see details
  • R. Rizzi, "On minimizing symmetric set functions" in COMBINATORICA, v. 20, n. 3 (2000), p. 445-450 - see details
  • R. Rizzi, "Indecomposable r-graphs and some other counterexamples" in JOURNAL OF GRAPH THEORY, v. 32, n. 1 (1999), p. 1-15 - see details
  • R. Rizzi, "Impaccando T-tagli e T-giunti" in BOLLETTINO DELL'UNIONE MATEMATICA ITALIANA. A, v. 8, n. 1-A S (1998), p. 201-204 - see details
  • A. Caprara, R. Rizzi, "Improving a Family of Approximation Algorithms to Edge Color Multigraphs" in INFORMATION PROCESSING LETTERS, v. 68, (1998), p. 11-15 - see details
  • R. Rizzi, "Konig's Edge Coloring Theorem without augmenting paths" in JOURNAL OF GRAPH THEORY, v. 29, (1998), p. 87-87 - see details
  • A. Bertossi, R. Battiti, R. Rizzi, "Randomized Greedy Algorithms for the Hypergraph Partitioning Problem" in P. Pardalos, S. Rajasekaran, J. Rolim (edited by), Randomized Methods in Algorithm Design, Providence, R.I.: American mathematical society, 1998, p. 3-21. - (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science; 43) - see details
  • R. Battiti, A. Bertossi, R. Rizzi, "Randomized greedy algorithms for the hypergraph partitioning problem": AMS, Providence, 1998, p. 21-35. Proceedings of: Randomized Methods in Algorithm Design, ,, 1998 - see details