Davide Bilò

	2012
32		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
31		Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti: Network Verification via Routing Table Queries. SIROCCO 2011: 270-281
30		Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011)
29		Davide Bilò, Luciano Gualà, Guido Proietti: Bounded-Distance Network Creation Games CoRR abs/1112.4264: (2011)
28		Anna Zych, Davide Bilò: New Reoptimization Techniques applied to Steiner Tree Problem. Electronic Notes in Discrete Mathematics 37: 387-392 (2011)
27		Davide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011)
	2010
26		Davide Bilò, Luciano Gualà, Guido Proietti: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149
25		Davide Bilò, Luciano Gualà, Guido Proietti: Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161
24		Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86
23		Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010)
	2009
22		Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91
21		Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer: Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112
20		Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99
19		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)
18		Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009)
	2008
17		Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
16		Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych: Reoptimization of Steiner Trees. SWAT 2008: 258-269
15		Davide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213
14		Davide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. WG 2008: 43-54
13		Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262
12		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)
11		Davide Bilò, Guido Proietti: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1): 43-55 (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
	2006
7		Davide Bilò, Guido Proietti: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24
6		Davide Bilò, Luciano Gualà, Guido Proietti: Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30
5		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
4		Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic Mechanism Design. WINE 2006: 3-15
	2005
3		Davide Bilò, Guido Proietti: Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64
	2004
2		Davide Bilò, Guido Proietti: Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171
1		Davide Bilò, Guido Proietti: A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA 2004: 181-196

Coauthor Index

1	Evangelos Bampas	[31]
2	Hans-Joachim Böckenhauer	[16] [22] [30]
3	Jörg Derungs	[10]
4	Yann Disser	[20]
5	Guido Drovandi	[31]
6	Thomas Erlebach	[17] [23]
7	Luca Forlizzi	[8] [9] [12] [14] [27]
8	Michael Gatto	[21]
9	Luciano Gualà	[4] [5] [6] [8] [9] [10] [12] [13] [18] [19] [21] [24] [25] [26] [29] [31] [32]
10	Juraj Hromkovic	[16]
11	Ralf Klasing	[31]
12	Dennis Komm	[22] [30]
13	Richard Královic	[16] [22] [30]
14	Stefano Leucci	[24]
15	Matús Mihalák	[17] [20] [23]
16	Tobias Mömke	[16] [22] [30]
17	Guido Proietti	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [18] [19] [21] [24] [25] [26] [27] [29] [31] [32]
18	Sebastian Seibert	[22] [30]
19	Subhash Suri	[20]
20	Elias Vicari	[20]
21	Peter Widmayer	[10] [13] [15] [16] [17] [20] [21] [23]
22	Anna Zych	[15] [16] [22] [28] [30]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page