On this page you can find a list of papers presented by members of the COST 295 Salerno site together with members of other COST 295 sites.
-
Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna and Walter Unger
On-line load balancing made simple: Greedy strikes back
J. Discrete Algorithms 5(1): pages 162-175, 2007.
-
Paolo Penna, Guido Proietti and Peter Widmayer
Strongly Polynomial-Time Truthful Mechanisms in One Shot
in Proceedings of Second International Workshop on Internet and Network Economics (WINE): pages 377-388, 2006.
-
Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou
and Paul G. Spirakis
The Price of Defense and Fractional Matchings
in Proceedings of the 8th International Conference on Distributed Computing and Networking
(ICDCN), pages 115-126, 2006.
-
Christos Kaklamanis, Danny Krizanc, Manuela Montangero and Giuseppe Persiano
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics 154(10): pages 1500-1509, 2006.
-
Iannis Caragiannis, Cristos Kaklamanis and Giuseppe Persiano
Approximation Algorithm for Path Coloring in Trees
In Efficient Approximation and Online Algorithms, volume 3484 of LNCS, pages 74–96, 2006.
-
Clemente Galdi, Christos Kaklamanis, Manuela Montangero and Giuseppe Persiano
Station Placement in Networks
In Efficient Approximation and Online Algorithms, volume 3484 of LNCS, pages 74–96, 2006.
-
Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi and Paola Vocca
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks
in Proceedings of 4th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW): pages 4-17, LNCS 3738, 2005.
-
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi and Riccardo Silvestri
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Theor. Comput. Sci. 343(1-2): pages 27-41, 2005.