Davide Bilò Vis

*	2009
18	EE	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
17	EE	Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009)
	2008
16	EE	Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
15	EE	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
14	EE	Davide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213
13	EE	Davide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. WG 2008: 43-54
12	EE	Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262
11	EE	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	EE	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	EE	Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361
8	EE	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	EE	Davide Bilò, Guido Proietti: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24
6	EE	Davide Bilò, Luciano Gualà, Guido Proietti: Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30
5	EE	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	EE	Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic Mechanism Design. WINE 2006: 3-15
	2005
3	EE	Davide Bilò, Guido Proietti: Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64
	2004
2	EE	Davide Bilò, Guido Proietti: Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171
1	EE	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	Hans-Joachim Böckenhauer	[15] [18]
2	Jörg Derungs	[10]
3	Thomas Erlebach	[16]
4	Luca Forlizzi	[8] [9] [13]
5	Luciano Gualà	[4] [5] [6] [8] [9] [10] [12] [17]
6	Juraj Hromkovic	[15]
7	Dennis Komm	[18]
8	Richard Královic	[15] [18]
9	Matús Mihalák	[16]
10	Tobias Mömke	[15] [18]
11	Guido Proietti	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [17]
12	Sebastian Seibert	[18]
13	Peter Widmayer	[10] [12] [14] [15] [16]
14	Anna Zych	[14] [15] [18]