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.

Discrete Mathematics
  • Anna Galluccio, Claudio Gentile: The stable set polytope of icosahedral graphs, Discrete Mathematics 339, 614-625, 2016
  • De Simone C., Mosca R.: Stable set and clique polytopes of (P5,gem)-free graphs, Discrete Mathematics 307, 2661-2670, 2007
  • Sara Nicoloso: Sum Coloring and Interval Graphs: a Tight Upper Bound for the Minimum Number of Colors, Discrete Mathematics 280, 251-257, 2004
  • Anna Galluccio, Hell P., Nešetřil J.: The complexity of $H$-colouring of bounded degree graphs, Discrete Mathematics 222, 101-109, 2000
  • Pirillo G.: Fibonacci numbers and words, Discrete Mathematics 173 (1-3), 197-207, 1997
  • Pirillo G., Varricchio S.: Some combinatorial properties of infinite words and applications to semigroup theory, in the Proceedings of Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics (Florence, 1993), 153 (1-3), 239-251, 1996
  • De Simone C., Deza M., Laurent M.: Collapsing and Lifting for the Cut Cone, Discrete Mathematics 127, 105-130, 1994
  • De Simone C., Anna Galluccio: New Classes of Berge Perfect Graphs, Discrete Mathematics 131, 67-79, 1994
  • Pirillo G.: On a combinatorial property of Fibonacci semigroup, Discrete Mathematics 122 (1-3), 263-267, 1993
  • De Simone C.: The Cut Polytope and the Boolean Quadric Polytope, Discrete Mathematics 79, 71-75, 1989
  • Justin J., Pirillo G.: Two combinatorial properties of partitions of the free semigroup into finitely many parts, Discrete Mathematics 52 (2-3), 299-303, 1984
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -