dblp.uni-trier.dewww.uni-trier.de

Davide Bilò

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
17EEDavide Bilò, Luciano Gualà, Guido Proietti: Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009)
2008
16EEDavide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
15EEDavide 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
14EEDavide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213
13EEDavide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. WG 2008: 43-54
12EEDavide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262
11EEDavide Bilò, Guido Proietti: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1): 43-55 (2008)
2007
10EEDavide 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
9EEDavide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361
8EEDavide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514
2006
7EEDavide Bilò, Guido Proietti: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24
6EEDavide Bilò, Luciano Gualà, Guido Proietti: Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30
5EEDavide Bilò, Luciano Gualà, Guido Proietti: On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309
4EEDavide Bilò, Luciano Gualà, Guido Proietti: Dynamic Mechanism Design. WINE 2006: 3-15
2005
3EEDavide Bilò, Guido Proietti: Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64
2004
2EEDavide Bilò, Guido Proietti: Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171
1EEDavide Bilò, Guido Proietti: A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA 2004: 181-196

Coauthor Index

1Hans-Joachim Böckenhauer [15]
2Jörg Derungs [10]
3Thomas Erlebach [16]
4Luca Forlizzi [8] [9] [13]
5Luciano Gualà [4] [5] [6] [8] [9] [10] [12] [17]
6Juraj Hromkovic [15]
7Richard Královic [15]
8Matús Mihalák [16]
9Tobias Mömke [15]
10Guido Proietti [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [17]
11Peter Widmayer [10] [12] [14] [15] [16]
12Anna Zych [14] [15]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)