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 Articles in Journals, Collections and Proceedings
(or show them all): (Items found: 15)
2007 | 2006 | 2005 | 2003 | 2001 | 2000 | 1999 | 1998
2007 [top]
- Bilò D., Derungs J., Gualà L., Proietti G., 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
- Bockenhauer H.J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Proietti G., Widmayer P.: On the Approximability of TSP on Local Modifications of Optimally Solved Instances, Algorithmic Operations Research 2 (2), 83-93, 2007
2006 [top]
- Bockenhauer H.J., Kneis J., Kupke J., Hromkovič J., Forlizzi L., Proietti G., 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., Proietti G., 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
- Proietti G., 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]
- Proietti G., 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]
- Nardelli E., Proietti G., Widmayer P.: Finding the Most Vital Node of a Shortest Path, Theoretical Computer Science 296 (1), 166-177, 2003
- Nardelli E., Proietti G., Widmayer P.: Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast, Algorithmica 35 (1), 56-74, 2003
2001 [top]
- Nardelli E., Proietti G., Widmayer P.: A Faster Computation of the Most Vital Edge of a Shortest Path, Information Processing Letters 79 (2), 81-85, 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
- Nardelli E., Proietti G., 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
2000 [top]
- 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
1999 [top]
- Nardelli E., Proietti G., 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., Proietti G., Widmayer P.: Finding the Detour Critical Edge of a Shortest Path between Two Nodes, Information Processing Letters 67 (1), 51-54, 1998
- Nardelli E., Proietti G., 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
|
