Publications of P. Widmayer

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 Widmayer P., in the category ALL (or show them all):   (Items found: 15)


2007 | 2006 | 2005 | 2003 | 2001 | 2000 | 1999 | 1998

2007  [top]

2006  [top]
  • Bockenhauer H.J., Kneis J., Kupke J., Hromkovič J., Forlizzi L., Guido Proietti, Widmayer P.: Reusing Optimal TSP Solutions for Locally Modified Input Instances, in the Proceedings of 4th IFIP International Conference on Theoretical Computer Science (TCS '06), 209, Springer Santiago, Chile, 251-270, 2006
  • Penna P., Guido Proietti, Widmayer P.: Strongly Polynomial-Time Truthful Mechanisms in One Shot, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 77-88, 2006
  • Guido Proietti, Widmayer P.: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii, in the Proceedings of 17th Annual International Symposium on Algorithms and Computation (ISAAC '06), Lecture Notes in Computer Science, 4288, Springer-Verlag Kolcata, India, 578-587, 2006

2005  [top]
  • Guido Proietti, Widmayer P.: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem, in the Proceedings of 17th Annual ACM Symposium on Parallel Algorithms, ISBN/ISSN: 1-58113-986-1, 195-202, 2005

2003  [top]

2001  [top]

2000  [top]
  • Nardelli E., Guido Proietti, 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

1999  [top]
  • Nardelli E., Guido Proietti, Widmayer P.: How to Swap a Failing Edge of a Single Source Shortest Paths Tree, in the Proceedings of 5th International Conference on Computing and Combinatorics {(COCOON'99)}, Asano T., Imai H., Lee D.T., Nakano S., Tokuyama T. eds., Lecture Notes in Computer Science, 1627, Springer-Verlag Tokyo, Japan, 144-153, 1999

1998  [top]
  • Nardelli E., Guido Proietti, Widmayer P.: Finding the Detour Critical Edge of a Shortest Path between Two Nodes, Information Processing Letters 67 (1), 51-54, 1998
  • Nardelli E., Guido Proietti, Widmayer P.: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures, in the Proceedings of 6th Annual European Symposium on Algorithms {(ESA '98)}, Bilardi G., Italiano G.F., Pietracaprina A., Pucci G. eds., Lecture Notes in Computer Science, 1461, Springer-Verlag Venezia, Italia, 55-66, 1998
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -