Augmenting the Edge-Connectivity of a Spider Tree. - Davide Bilò; Guido Proietti (ISAAC, 2004)

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

Range Augmentation Problems in Static Ad-Hoc Wireless Networks. - Davide Bilò; Guido Proietti (SIROCCO, 2005)

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (CAAN, 2006)

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (SIROCCO, 2006)

Locating Facilities on a Network to Minimize Their Average Service Radius. - Davide Bilò; Jörg Derungs; Luciano Gualà; Guido Proietti; Peter Widmayer (ISAAC, 2007)

An algorithm composition scheme preserving monotonicity. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (PODC, 2007)

Reoptimization of Steiner Trees. - Davide Bilò; Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Widmayer; Anna Zych (SWAT, 2008)

Reoptimization of Weighted Graph and Covering Problems. - Davide Bilò; Peter Widmayer; Anna Zych (WAOA, 2008)

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

Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (Internet Math., 2008)

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

Stability of Networks in Stretchable Graphs. - Davide Bilò; Michael Gatto; Luciano Gualà; Guido Proietti; Peter Widmayer (SIROCCO, 2009)

Dynamic mechanism design. - Davide Bilò; Luciano Gualà; Guido Proietti (Theor. Comput. Sci., 2009)

Discovery of network properties with all-shortest-paths queries. - Davide Bilò; Thomas Erlebach; Matús Mihalák; Peter Widmayer (Theor. Comput. Sci., 2010)

Reoptimization of the Shortest Common Superstring Problem. - Davide Bilò; Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Tobias Mömke; Sebastian Seibert; Anna Zych (Algorithmica, 2011)

New Reoptimization Techniques applied to Steiner Tree Problem. - Anna Zych; Davide Bilò (Electron. Notes Discret. Math., 2011)

Approximating the Metric TSP in Linear Time. - Davide Bilò; Luca Forlizzi; Guido Proietti (Theory Comput. Syst., 2011)

New Advances in Reoptimizing the Minimum Steiner Tree Problem. - Davide Bilò; Anna Zych (MFCS, 2012)

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

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

Polygon-Constrained Motion Planning Problems. - Davide Bilò; Yann Disser; Luciano Gualà; Matús Mihalák; Guido Proietti; Peter Widmayer (ALGOSENSORS, 2013)

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2014)

Improved Purely Additive Fault-Tolerant Spanners. - Davide Bilò; Fabrizio Grandoni 001; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2015)

A Faster Computation of All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2015)

New bounds for the balloon popping problem. - Davide Bilò; Vittorio Bilò (J. Comb. Optim., 2015)

Network verification via routing table queries. - Evangelos Bampas; Davide Bilò; Guido Drovandi; Luciano Gualà; Ralf Klasing; Guido Proietti (J. Comput. Syst. Sci., 2015)

The max-distance network creation game on general host graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Specializations and generalizations of the Stackelberg minimum spanning tree game. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Bounded-Distance Network Creation Games. - Davide Bilò; Luciano Gualà; Guido Proietti (ACM Trans. Economics and Comput., 2015)

Compact and Fast Sensitivity Oracles for Single-Source Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2016)

Exact and approximate algorithms for movement problems on (special classes of) graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2016)

Locality-Based Network Creation Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ACM Trans. Parallel Comput., 2016)

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2017)

On the Complexity of Two Dots for Narrow Boards and Few Colors. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Neeldhara Misra (FUN, 2018)

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (FUN, 2018)

A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. - Davide Bilò; Kleitos Papadopoulos (ISAAC, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2018)

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs. - Davide Bilò; Kleitos Papadopoulos (CoRR, 2018)

Fair Tree Connection Games with Topology-Dependent Edge Cost. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko; Louise Molitor (FSTTCS, 2020)

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2020)

On the Tree Conjecture for the Network Creation Game. - Davide Bilò; Pascal Lenzner (Theory Comput. Syst., 2020)

Tracking routes in communication networks. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2020)

Selfish Creation of Social Networks. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Stefanie Lowski; Anna Melnichenko (AAAI, 2021)

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (ESA, 2021)

Space-Efficient Fault-Tolerant Diameter Oracles. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (MFCS, 2021)

Network Creation Games with Traceroute-Based Strategies. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithms, 2021)

Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithms, 2021)

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (CoRR, 2021)

Sparse Temporal Spanners with Low Stretch. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (ESA, 2022)

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (ICALP, 2022)

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (IJCAI, 2022)

Fixed-Parameter Sensitivity Oracles. - Davide Bilò; Katrin Casel; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Martin Schirneck; Simon Wietheger (ITCS, 2022)

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (STACS, 2022)

Topological influence and locality in swap schelling games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (Auton. Agents Multi Agent Syst., 2022)

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2022)

Almost optimal algorithms for diameter-optimally augmenting trees. - Davide Bilò (Theor. Comput. Sci., 2022)

Cutting bamboo down to size. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Giacomo Scornavacca (Theor. Comput. Sci., 2022)

New approximation algorithms for the heterogeneous weighted delivery problem. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (Theor. Comput. Sci., 2022)

Fault-Tolerant ST-Diameter Oracles. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (ICALP, 2023)

Schelling Games with Continuous Types (short paper). - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (ICTCS, 2023)

Schelling Games with Continuous Types. - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (IJCAI, 2023)

Temporal Network Creation Games. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (IJCAI, 2023)

Compact Distance Oracles with Large Sensitivity and Low Stretch. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (WADS, 2023)

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (CoRR, 2023)

Graph Spanners for Group Steiner Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Alessandro Straziota (ESA, 2024)

Improved Distance (Sensitivity) Oracles with Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (FOCS, 2024)

Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. - Davide Bilò; Luca Di Donato; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

Swapping Mixed-Up Beers to Keep Them Cool. - Davide Bilò; Maurizio Fiusco; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (ICTCS, 2024)

Temporal Queries for Dynamic Temporal Forests. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Alessandro Straziota (ISAAC, 2024)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (CoRR, 2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (TheoretiCS, 2024)

Geometric Network Creation Games. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko (SIAM J. Discret. Math., 2024)

Blackout-tolerant temporal spanners. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (J. Comput. Syst. Sci., 2024)

New Algorithms for Steiner Tree Reoptimization. - Davide Bilò (Algorithmica, 2024)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (AAAI, 2025)

Temporal Network Creation Games: The Impact of Non-Locality and Terminals. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (AAMAS, 2025)

On the Approximability of Graph Visibility Problems. - Davide Bilò; Alessia Di Fonso; Gabriele Di Stefano; Stefano Leucci 001 (WALCOM, 2025)

Finding diameter-reducing shortcuts in trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Luca Pepè Sciarria (J. Comput. Syst. Sci., 2025)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (CoRR, 2025)