Publications of Paolo Ventura

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Ventura P., in the category Articles in Collections and Proceedings (or show them all):   (Items found: 7)

2018 | 2017 | 2012 | 2009 | 2008 | 2005 | 2002
2018  [top]
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: A new lower bound for the Block Relocation Problem, in the Proceedings of ICCL 2018, Lecture Notes in Computer Science, 11184, pp. 168–174, 2018
2017  [top]
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: Some Complexity Results for the Minimum Blocking Items Problem, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 475-483, 2017
2012  [top]
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with stability number greater than three, in: Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Schmedders K., Luethi H.-J., Klatte D. eds., Operations Research Proceedings, Springer Heidelberg Germania, 47-52, 2012
2009  [top]
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The k-gear composition and the stable set polytope, in the Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, June 2-4, Liberti L., Cafieri S., Mucherino A., Nannicini G., Tarissan F. eds., 2009
2008  [top]
2005  [top]
  • Eisenbrand F., Oriolo G., Stauffer G., Paolo Ventura: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs, in: Integer Programming and Combinatorial Optimization - IPCO XI, Lecture Notes in Computer Science, 3509, 291-305, 2005
2002  [top]
  • Eisenbrand F., Giovanni Rinaldi, Paolo Ventura: 0/1 Optimization and 0/1 Primal Separation are Equivalent, in the Proceedings of Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 920-926, 2002
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -