OPTIMIZATION, DISCRETE MATHEMATICS AND APPLICATIONS (OPTIMA)

This page shows the publications appeared in journals, collections, periodic conferences, and books whose authors are currently affiliated with the Institute. The publications are grouped by research topic and then by publication site. Finally, each publication site is linked to the corresponding article list. The numbers in square brackets give the total number of publications associated with the corresponding item.

Lecture Notes in Computer Science
  • 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
  • Bilò D., Colella F., Gualà L., Leucci S., Proietti G.: A Faster Computation of All the Best Swap Edges of a Tree Spanner, in the Proceedings of 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), Lecture Notes in Computer Science, 9439, 2015
  • Bilò D., Grandoni F., Gualà L., Leucci S., Proietti G.: Improved Purely Additive FaultTolerant Spanners, in the Proceedings of 23rd European Symposium on Algorithms (ESA’15), September 14-16, 2015, Patras, Greece, Lecture Notes in Computer Science, 9294, 2015
  • D'Andrea A., D'Emidio M., Frigioni D., Leucci S., Proietti G.: Path-Fault-Tolerant Approximate Shortest-Path Trees, Lecture Notes in Computer Science, 9439, 2015
  • Bilò D., Gualà L., Leucci S., Proietti G.: Fault-Tolerant Approximate Shortest-Path Trees, in the Proceedings of Proc. of the 22nd European Symposium on Algorithms (ESA 2014), Lecture Notes in Computer Science, 8737, 2014
  • Bilò D., Gualà L., Leucci S., Proietti G.: Network Creation Games with Traceroute-Based Strategies, in the Proceedings of Proc. of the 21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Lecture Notes in Computer Science, 8576, 2014
  • D'Andrea A., D'Emidio M., Frigioni D., Leucci S., Proietti G.: Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches, in the Proceedings of Proc. of the 13th International Symposium on Experimental Algorithms (SEA'14), Lecture Notes in Computer Science, 8504, 2014
  • De Simone C., Anna Galluccio: A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs, in: Combinatorial optimization and applications, Lecture Notes in Computer Science, 5165, 351-360, 2008
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: On the stable set polytope of claw-free graphs, in: COCOA 2008, Lecture Notes in Computer Science, 5165, 339-350, 2008
  • Lodi A., Panconesi A., Rinaldi G. eds.: Integer Programming and Combinatorial Optimization - IPCO XIII, Lecture Notes in Computer Science, 5035, Springer, 2008
  • Di Battista G., Drovandi G., Frati F.: How to Draw a Clustered Tree, in the Proceedings of 10th Workshop on Algorithms and Data Structures (WADS '07), Sack J.R., Dehne F., Zeh N. eds., Lecture Notes in Computer Science, 4619, 2007
  • 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
  • Conforti M., Anna Galluccio, Proietti G.: Edge-connectivity augmentation and network matrices, in: Graph-Theoretic Concepts in Computer Science, Hromkovic J., Nagl M., Westfechtel B. eds., Lecture Notes in Computer Science, 3353, 355-364, 2004
  • Anna Galluccio, Proietti G.: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
  • Avis D., De Simone C., Nobili P.: Two conjectures on the chromatic polynomial, in: LATIN 2000: Theoretical Informatics, Gonnet G.H., Panario D., Viola A. eds., Lecture Notes in Computer Science, 1776, Springer-Verlag, 154-162, 2000
  • Bertolazzi P., Di Battista G., Didimo W.: Quasi-upward planarity, in the Proceedings of 6-th International Symposium GD '98, Whitesides S.H. ed., Lecture Notes in Computer Science, 1574, Springer-Verlag, 15-29, 1998
  • Bertolazzi P., Di Battista G., Mannino C., Tamassia R.: Upward planarity testing of Single-Source digraphs, in the Proceedings of European Symposium on Algorithms, Lengauer T. ed., Lecture Notes in Computer Science, 726, 1993
  • Bertolazzi P., Di Battista G., Tamassia R., Tollis J.: How to draw a series-parallel digraph, in the Proceedings of Algorithm Theory-{SWAT92}, Lecture Notes in Computer Science, 621, Springer-Verlag, 1992
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -