Publications of L. Gualà

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 Gualà L., in the category ALL (or show them all):   (Items found: 21)


2015 | 2014 | 2007 | 2006 | 2005

2015  [top]

2014  [top]
  • Bilò D., Gualà L., Leucci S., Guido Proietti: Fault-Tolerant Approximate Shortest-Path Trees, in the Proceedings of Proc. of the 22nd European Symposium on Algorithms (ESA 2014), Lecture Notes in Computer Science, 8737, 2014
  • Bilò D., Gualà L., Leucci S., Guido Proietti: Local-knowledge Network Creation Games, in the Proceedings of Proc. of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14),, 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14), 2014
  • Bilò D., Gualà L., Leucci S., Guido Proietti: Network Creation Games with Traceroute-Based Strategies, in the Proceedings of Proc. of the 21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Lecture Notes in Computer Science, 8576, 2014
  • Bilò D., Gualà L., Guido Proietti: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree, Algorithmica 68, 337-357, 2014

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
  • 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

2006  [top]
  • Bilò D., Gualà L., Guido Proietti: Dynamic Mechanism Design, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 3-15, 2006
  • Bilò D., Gualà L., Guido Proietti: Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem, in the Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN '06), Lecture Notes in Computer Science, 4235, Springer-Verlag Chester, UK, 19-30, 2006
  • Bilò D., Gualà L., Guido Proietti: On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem, in the Proceedings of 13th Coll. on Structural Information and Communication Complexity (SIROCCO '06), Lecture Notes in Computer Science, 4056, Springer-Verlag Chester, UK, 295-309, 2006

2005  [top]
  • Gualà L., Guido Proietti: A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals, in the Proceedings of 11th Annual International Conference on Computing and Combinatorics, Lecture Notes in Computer Science, 3595, 390-400, 2005
  • Gualà L., Guido Proietti: Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem, in the Proceedings of 11th International Euro-Par Conference, Lecture Notes in Computer Science, 3468, 941-951, 2005
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -