Davide Bilò

Davide Bilò, Vittorio Bilò: New Bounds for the Balloon Popping Problem. COCOON 2013: 5-16

Davide Bilò, Luciano Gualà, Guido Proietti: Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012)

Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012)

Davide Bilò, Anna Zych: New Advances in Reoptimizing the Minimum Steiner Tree Problem. MFCS 2012: 184-197

Davide Bilò, Luciano Gualà, Guido Proietti: Bounded-Distance Network Creation Games. WINE 2012: 72-85

Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti: The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405

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)

Anna Zych, Davide Bilò: New Reoptimization Techniques applied to Steiner Tree Problem. Electronic Notes in Discrete Mathematics 37: 387-392 (2011)

Davide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011)

Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti: Network Verification via Routing Table Queries. SIROCCO 2011: 270-281

Davide Bilò, Luciano Gualà, Guido Proietti: Bounded-Distance Network Creation Games. CoRR abs/1112.4264 (2011)

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)

Davide Bilò, Luciano Gualà, Guido Proietti: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149

Davide Bilò, Luciano Gualà, Guido Proietti: Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161

Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86

Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009)

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

Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99

Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer: Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112

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)

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)

Davide Bilò, Guido Proietti: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1): 43-55 (2008)

Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103

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

Davide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213

Davide Bilò, Luca Forlizzi, Guido Proietti: Approximating the Metric TSP in Linear Time. WG 2008: 43-54

Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262

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

Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361

Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti: Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514

Davide Bilò, Guido Proietti: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24

Davide Bilò, Luciano Gualà, Guido Proietti: Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30

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

Davide Bilò, Luciano Gualà, Guido Proietti: Dynamic Mechanism Design. WINE 2006: 3-15

Davide Bilò, Guido Proietti: Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64

Davide Bilò, Guido Proietti: Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171

Davide Bilò, Guido Proietti: A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA 2004: 181-196