Luciano Gualà

	2012
22		Davide Bilò, Luciano Gualà, Guido Proietti: Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012)
	2011
21		Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti: Network Verification via Routing Table Queries. SIROCCO 2011: 270-281
20		Davide Bilò, Luciano Gualà, Guido Proietti: Bounded-Distance Network Creation Games CoRR abs/1112.4264: (2011)
	2010
19		Davide Bilò, Luciano Gualà, Guido Proietti: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149
18		Davide Bilò, Luciano Gualà, Guido Proietti: Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161
17		Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86
	2009
16		Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer: Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112
15		Patrick Briest, Martin Hoefer, Luciano Gualà, Carmine Ventre: On Stackelberg Pricing with Computationally Bounded Consumers. WINE 2009: 42-54
14		Davide Bilò, Luciano Gualà, Guido Proietti: Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electronic Colloquium on Computational Complexity (ECCC) 16: 112 (2009)
13		Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009)
	2008
12		Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262
11		Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Mathematics 5(4): 411-437 (2008)
	2007
10		Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer: Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598
9		Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361
8		Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514
7		Luciano Gualà, Guido Proietti: Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica 49(3): 171-191 (2007)
6		Luciano Gualà, Guido Proietti: Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurrency and Computation: Practice and Experience 19(17): 2285-2297 (2007)
	2006
5		Davide Bilò, Luciano Gualà, Guido Proietti: Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30
4		Davide Bilò, Luciano Gualà, Guido Proietti: On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309
3		Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic Mechanism Design. WINE 2006: 3-15
	2005
2		Luciano Gualà, Guido Proietti: A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. COCOON 2005: 390-400
1		Luciano Gualà, Guido Proietti: Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par 2005: 941-951

Coauthor Index

1	Evangelos Bampas	[21]
2	Davide Bilò	[3] [4] [5] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [20] [21] [22]
3	Patrick Briest	[15]
4	Jörg Derungs	[10]
5	Guido Drovandi	[21]
6	Luca Forlizzi	[8] [9] [11]
7	Michael Gatto	[16]
8	Martin Hoefer	[15]
9	Ralf Klasing	[21]
10	Stefano Leucci	[17]
11	Guido Proietti	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [20] [21] [22]
12	Carmine Ventre	[15]
13	Peter Widmayer	[10] [12] [16]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page