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.

Theoretical Computer Science
  • Bilò D., Gualà L., Leucci S., Proietti G.: The Max-Distance Network Creation Game on General Host Graphs, Theoretical Computer Science 573, 43-53, 2015
  • Bilò D., Gualà L., Leucci S., Proietti G.: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game, Theoretical Computer Science 562, 643-657, 2015
  • Michel C.J., Pirillo G., Pirillo M.A.: A relation between trinucleotide comma-free codes and trinucleotide circular codes, Theoretical Computer Science 401, 17-26, 2008
  • De Simone C., Anna Galluccio: Edge colouring of regular graphs of large degree, Theoretical Computer Science 389, 91-99, 2007
  • De Simone C., Picinin de Mello C.: Edge-colouring of join graphs, Theoretical Computer Science 3, 364-370, 2006
  • Pirillo G.: Inequalities characterizing standard Sturmian and episturmian words, Theoretical Computer Science 341 (1-3), 276-292, 2005
  • Justin J., Pirillo G.: Episturmian words and episturmian morphisms, Theoretical Computer Science 276 (1-2), 281-313, 2002
  • Droubay X., Justin J., Pirillo G.: Epi-Sturmian words and some constructions of de Luca and Rauzy, Theoretical Computer Science 255 (1-2), 539-553, 2001
  • Justin J., Pirillo G.: Fractional powers in Sturmian words, Theoretical Computer Science 255 (1-2), 363-376, 2001
  • Droubay X., Pirillo G.: Palindromes and Sturmian words, Theoretical Computer Science 223 (1-2), 73-85, 1999
  • Justin J., Pirillo G.: On a combinatorial property of Sturmian words, Theoretical Computer Science 154 (2), 387-394, 1996
  • Justin J., Pirillo G.: On a question about factorization forests, Theoretical Computer Science 141 (1-2), 351-355, 1995
  • Bertolazzi P., Sassano A.: An O(mn) Algorithm for Regular Set-Covering Problems, Theoretical Computer Science 54, 237-247, 1987
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -