Publications of Guido Proietti

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 Proietti G., in the category Articles in Collections (or show them all):   (Items found: 13)


2004 | 2003 | 2002 | 2001 | 2000 | 1997

2004  [top]
  • 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

2003  [top]

2002  [top]
  • Böckenhauer H.J., Bongartz D., Hromkovič J., Klasing R., Proietti G., Seibert S., Unger W.: On the Hardness of Constructing Minimal Biconnected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality, in: 22nd Int. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), Lecture Notes in Computer Science, 2556, Springer-Verlag, 59-70, 2002
  • 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

2001  [top]
  • 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
  • Nardelli E., Proietti G., Widmayer P.: Finding the Most Vital Node of a Shortest Path, Lecture Notes in Computer Science, 2108, Springer-Verlag, 278-287, 2001

2000  [top]
  • Nardelli E., Proietti G.: Size Estimation of the Intersection Join Between Two Line Segment Datasets, in: Current Issues in Databases and Information Systems - Advances in Databases and Information Systems (ADBIS 2000), Stuller J., Pokorn{ý} J., Thalheim B., Masunaga Y. eds., Lecture Notes in Computer Science, 1884, Springer-Verlag, 229-238, 2000
  • Nardelli E., Proietti G., Widmayer P.: Maintaining a Minimimum Spanning Tree Under Transient Node Failures, in: Algorithms - Annual European Symposium (ESA 2000), Peterson M. ed., Lecture Notes in Computer Science, 1879, Springer-Verlag, 346-355, 2000
  • Proietti G.: Dynamic Maintenance Versus Swapping: an Experimental Study on Shortest Paths Trees, in: Algorithm Engineering (WAE 2000), Näher S., Wagner D. eds., Lecture Notes in Computer Science, 1982, Springer-Verlag, 207-217, 2000

1997  [top]
  • 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
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -