Davide Bilò

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 92

Top Venues

Publications

Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR (2024)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
Geometric Network Creation Games. SIAM J. Discret. Math. 38 (1) (2024)
Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
Graph Spanners for Group Steiner Distances. CoRR (2024)
Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
On the approximability of graph visibility problems. CoRR (2024)
Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN (2024)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141 (2024)
Davide Bilò
New Algorithms for Steiner Tree Reoptimization. Algorithmica 86 (8) (2024)
Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci
Swapping Mixed-Up Beers to Keep Them Cool. FUN (2024)
Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
Finding Diameter-Reducing Shortcuts in Trees. CoRR (2023)
Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR (2023)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
Temporal Network Creation Games. IJCAI (2023)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS (2023)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR (2023)
Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC (2023)
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
Schelling Games with Continuous Types. IJCAI (2023)
Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR (2023)
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
Schelling Games with Continuous Types (short paper). ICTCS (2023)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Fault-Tolerant ST-Diameter Oracles. ICALP (2023)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
Temporal Network Creation Games. CoRR (2023)
Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
Schelling Games with Continuous Types. CoRR (2023)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
Fault-Tolerant ST-Diameter Oracles. CoRR (2023)
Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
Finding Diameter-Reducing Shortcuts in Trees. WADS (2023)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. CoRR (2022)
Davide Bilò
Almost optimal algorithms for diameter-optimally augmenting trees. Theor. Comput. Sci. 931 (2022)
Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. CoRR (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84 (1) (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. ESA (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting bamboo down to size. Theor. Comput. Sci. 909 (2022)
Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. IJCAI (2022)
Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Topological influence and locality in swap schelling games. Auton. Agents Multi Agent Syst. 36 (2) (2022)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP (2022)
Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
Fixed-Parameter Sensitivity Oracles. ITCS (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-Tolerant Temporal Spanners. ALGOSENSORS (2022)
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932 (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR (2021)
Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
Fixed-Parameter Sensitivity Oracles. CoRR (2021)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Space-Efficient Fault-Tolerant Diameter Oracles. MFCS (2021)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Space-Efficient Fault-Tolerant Diameter Oracles. CoRR (2021)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. Algorithms 14 (2) (2021)
Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO (2021)
Davide Bilò, Luciano Gualà, Guido Proietti
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms 14 (1) (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo down to Size. FUN (2021)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
Selfish Creation of Social Networks. AAAI (2021)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
Selfish Creation of Social Networks. CoRR (2020)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking routes in communication networks. Theor. Comput. Sci. 844 (2020)
Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Topological Influence and Locality in Swap Schelling Games. CoRR (2020)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo Down to Size. CoRR (2020)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS (2020)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica 82 (2) (2020)
Davide Bilò, Pascal Lenzner
On the Tree Conjecture for the Network Creation Game. Theory Comput. Syst. 64 (3) (2020)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR (2020)
Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Topological Influence and Locality in Swap Schelling Games. MFCS (2020)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
Geometric Network Creation Games. SPAA (2019)
Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
Geometric Network Creation Games. CoRR (2019)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking Routes in Communication Networks. SIROCCO (2019)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN (2018)
Davide Bilò
Almost optimal algorithms for diameter-optimally augmenting trees. CoRR (2018)
Davide Bilò, Kleitos Papadopoulos
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. CoRR (2018)
Davide Bilò, Kleitos Papadopoulos
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs. CoRR (2018)
Davide Bilò, Pascal Lenzner
On the Tree Conjecture for the Network Creation Game. STACS (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN (2018)
Davide Bilò
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. ISAAC (2018)
Davide Bilò
New algorithms for Steiner tree reoptimization. ICALP (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80 (12) (2018)
Davide Bilò
New algorithms for Steiner tree reoptimization. CoRR (2018)
Davide Bilò, Kleitos Papadopoulos
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. ISAAC (2018)
Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
Efficient Oracles and Routing Schemes for Replacement Paths. STACS (2018)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC (2017)
Davide Bilò, Pascal Lenzner
On the Tree Conjecture for the Network Creation Game. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO (2017)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based Network Creation Games. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3 (1) (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652 (2016)
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
Network verification via routing table queries. J. Comput. Syst. Sci. 81 (1) (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573 (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562 (2015)
Davide Bilò, Luciano Gualà, Guido Proietti
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3 (3) (2015)
Davide Bilò, Luciano Gualà, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73 (3) (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. CoRR (2015)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. ESA (2015)
Davide Bilò, Vittorio Bilò
New bounds for the balloon popping problem. J. Comb. Optim. 29 (1) (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The Max-Distance Network Creation Game on General Host Graphs. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based network creation games. SPAA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. SIROCCO (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. ESA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR (2014)
Davide Bilò, Luciano Gualà, Guido Proietti
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68 (2) (2014)

Davide Bilò.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Davide Bilò