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  2001, with author Proietti G., in the category Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 8)

2001  [top]
  • Flammini M., Nardelli E., Guido Proietti: ATM Layouts with Bounded Hop Count and Congestion, Distributed Computing 14, 65-73, 2001
  • Carlo Gaibisso, Guido Proietti, Tan R.: Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases, in the Proceedings of 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'01), 2001
  • Anna Galluccio, Guido Proietti: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
  • Manolopoulos Y., Nardelli E., Guido Proietti, Tousidou E.: A Generalized Comparison of Linear Representations of Thematic Layers, Data & Knowledge Engineering 37, 1-23, 2001
  • Nardelli E., Guido Proietti, Widmayer P.: A Faster Computation of the Most Vital Edge of a Shortest Path, Information Processing Letters 79 (2), 81-85, 2001
  • Nardelli E., Guido Proietti, Widmayer P.: Finding the Most Vital Node of a Shortest Path, Lecture Notes in Computer Science, 2108, Springer-Verlag, 278-287, 2001
  • Nardelli E., Guido Proietti, Widmayer P.: Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures, Journal of Graph Algorithms and Applications 5, 39-57, 2001
  • Guido Proietti, Faloutsos C.: Accurate Modeling of Region Data, IEEE Transactions on Knowledge and Data Engineering 13, 874-883, 2001
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -