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


2007  [top]
  • Bilò D., Derungs J., Gualà L., Guido Proietti, Widmayer P.: Locating Facilities on a Network to Minimize their Average Service Radius, in the Proceedings of 18th International Symposium on Algorithms and Computation (ISAAC'07), December 17-19, 2007, Sendai, Japan, Lecture Notes in Computer Science, 4835, 587-598, 2007
  • Bilò D., Forlizzi L., Gualà L., Guido Proietti: Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems, in the Proceedings of 3rd International Workshop on Internet & Network Economics (WINE'07), December 12-14, 2007, San Diego, USA, Lecture Notes in Computer Science, 4858, 503-514, 2007
  • Bilò D., Forlizzi L., Gualà L., Guido Proietti: An Algorithm Composition Scheme Preserving Monotonicity, in the Proceedings of 26th ACM Symposium on Principles of Distributed Computing (PODC'07), ACM Press Portland, USA, 360-361, 2007
  • Bockenhauer H.J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Guido Proietti, Widmayer P.: On the Approximability of TSP on Local Modifications of Optimally Solved Instances, Algorithmic Operations Research 2 (2), 83-93, 2007
  • Di Salvo A., Guido Proietti: Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor, Theoretical Computer Science 383 (1), 23-33, 2007
  • Gualà L., Guido Proietti: Efficient Truthful Mechanisms for the Single-source Shortest Paths Tree Problem, Concurrency and Computation-Practice & Experience 19 (17), 2285-2297, 2007
  • Gualà L., Guido Proietti: Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem, Algorithmica 49 (3), 171-191, 2007
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -