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
  • Mauro Mazzei, Palma A.L.: Comparative Analysis of Models of Location and Spatial Interaction, in the Proceedings of Computational Science and Its Applications ICCSA 2014, Lecture Notes in Computer Science, 8582, 2014
  • Becchetti L., Bonifaci V., Dirnberger M., Karrenbauer A., Mehlhorn K.: Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds, in the Proceedings of the 40th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 2013
  • Bonifaci V., Demetrescu C., Marchetti Spaccamela A. eds.: Experimental Algorithms - 12th International Symposium, SEA 2013, Lecture Notes in Computer Science, Springer Berlin, 2013
  • Baruah S., Bonifaci V., D'Angelo G., Li H., Marchetti Spaccamela A., Megow N., Stougie L.: Scheduling Real-Time Mixed-Criticality Jobs, in the Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 2010
  • Bonifaci V., Marchetti Spaccamela A.: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems, in the Proceedings of the 18th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, 2010
  • Alessandro Borri, Di Benedetto M. D., Di Benedetto M.-G.: Hybrid Modelling, Power Management and Stabilization of Cognitive Radio Networks, in: Hybrid Systems: Computation and Control 2009, Tabuada P., Majumdar R. eds., Lecture Notes in Computer Science, 5469, Springer-Verlag, Berlin Heidelberg, 76-89, 2009
  • Bonifaci V., Marchetti Spaccamela A., Stiller S.: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling, in the Proceedings of the 16th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, 2008
  • 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
  • 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
  • Carlo Gaibisso, Proietti G., Tan R.: Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs, in: Proceedings of the 9th Annual Int. Computing and Combinatorics Conf. (COCOON'03), Lecture Notes in Computer Science, 2697, Springer-Verlag, 404-414, 2003
  • Anna Galluccio, Proietti G.: A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation, in: Proc. 13th Annual International Symposium on Algorithms and Computation (ISAAC'02), Lecture Notes in Computer Science, 2518, Springer-Verlag, 150-162, 2002
  • 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
  • Becchetti L., Carlo Gaibisso: Lower Bounds for the Virtual Path Layout Problem in ATM Networks, in: Proceedings of SOFSEM '97: Theory and Practice of Informatics, Milovy, Repubblica Ceca, 22-29 novembre 1997., Jeffrey K.G., Plášil F. eds., Lecture Notes in Computer Science, 1338, Springer-Verlag, 375-382, 1997
  • Bertolazzi P., Di Battista G., Didimo W.: Computing Orthogonal Drawings with the Minimum Number of Bends, in the Proceedings of Proceedings WADS'97, Lecture Notes in Computer Science, 1272, Springer-Verlag, 1997
  • Carlo Gaibisso, Proietti G.: Efficient Insertion of Approximately Sorted Sequences of Items into a Dictionary, in: Proceedings of SOFSEM'97: Theory and Practice of Informatics, Milovy, Repubblica Ceca, 22-29 novembre 1997, Jeffrey K.G., Plášil F. eds., Lecture Notes in Computer Science, 1338, Springer-Verlag, 399-406, 1997
  • Carlo Gaibisso, Proietti G., Nardelli E.: An Output Sensitive Solution to the Set Union and Intersection Problem, in the Proceedings of Proceedings of "SOFSEM '96: Theory and Practice of Informatics", Milovy, Repubblica Ceca, 23-30 novembre 1996., Kral J., Jeffery K., Bartosek M. eds., Lecture Notes in Computer Science, 1996
  • 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
  • Carlo Gaibisso: A Partially Persistent Data Structure for the Set-Union Problem with Backtracking, in the Proceedings of Proceedings of the 5th International Meeting of Young Computer Scientists (IMYCS '88), Smolenice, Cecoslovacchia, 14-18 November 1988, Dassow J., Kelemen J. eds., Lecture Notes in Computer Science, 1988
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -