Davide Bil
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
67
Venues
20
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
67 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Hierarchical Spanners. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2026 | ICALP | Simpler and Improved Replacement Path Coverings. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck |
| 2025 | AAAI | Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2025 | Algosensors | Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2025 | ISAAC | On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. | Davide Bil, Giordano Colli, Luca Forlizzi, Stefano Leucci |
| 2025 | WALCOM | On the Approximability of Graph Visibility Problems. | Davide Bil, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci |
| 2024 | ESA | Graph Spanners for Group Steiner Distances. | Davide Bil, Luciano Gual, Stefano Leucci, Alessandro Straziota |
| 2024 | FOCS | Improved Distance (Sensitivity) Oracles with Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2024 | FUN | Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. | Davide Bil, Luca Di Donato, Luciano Gual, Stefano Leucci |
| 2024 | FUN | Swapping Mixed-Up Beers to Keep Them Cool. | Davide Bil, Maurizio Fiusco, Luciano Gual, Stefano Leucci |
| 2024 | ISAAC | Temporal Queries for Dynamic Temporal Forests. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2023 | ICALP | Fault-Tolerant ST-Diameter Oracles. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | IJCAI | Schelling Games with Continuous Types. | Davide Bil, Vittorio Bil, Michelle Dring, Pascal Lenzner, Louise Molitor, Jonas Schmidt |
| 2023 | IJCAI | Temporal Network Creation Games. | Davide Bil, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas |
| 2023 | STOC | Approximate Distance Sensitivity Oracles in Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | WADS | Compact Distance Oracles with Large Sensitivity and Low Stretch. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | WADS | Finding Diameter-Reducing Shortcuts in Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Luca Pep Sciarria |
| 2022 | Algosensors | Blackout-Tolerant Temporal Spanners. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Mirko Rossi |
| 2022 | ESA | Sparse Temporal Spanners with Low Stretch. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Mirko Rossi |
| 2022 | ICALP | Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2022 | IJCAI | Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. | Davide Bil, Vittorio Bil, Pascal Lenzner, Louise Molitor |
| 2022 | STACS | Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2021 | AAAI | Selfish Creation of Social Networks. | Davide Bil, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko |
| 2021 | ESA | Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | FUN | Cutting Bamboo down to Size. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Giacomo Scornavacca |
| 2021 | MFCS | Space-Efficient Fault-Tolerant Diameter Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | SIROCCO | New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2020 | MFCS | Topological Influence and Locality in Swap Schelling Games. | Davide Bil, Vittorio Bil, Pascal Lenzner, Louise Molitor |
| 2019 | SPAA | Geometric Network Creation Games. | Davide Bil, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko |
| 2019 | SIROCCO | Tracking Routes in Communication Networks. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2018 | FUN | On the Complexity of Two Dots for Narrow Boards and Few Colors. | Davide Bil, Luciano Gual, Stefano Leucci, Neeldhara Misra |
| 2018 | FUN | On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2018 | ICALP | New algorithms for Steiner tree reoptimization. | Davide Bil |
| 2018 | ISAAC | Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. | Davide Bil |
| 2018 | ISAAC | A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. | Davide Bil, Kleitos Papadopoulos |
| 2018 | STACS | Efficient Oracles and Routing Schemes for Replacement Paths. | Davide Bil, Keerti Choudhary, Luciano Gual, Stefano Leucci, Merav Parter, Guido Proietti |
| 2018 | STACS | On the Tree Conjecture for the Network Creation Game. | Davide Bil, Pascal Lenzner |
| 2017 | ISAAC | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2017 | SIROCCO | Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | ESA | Compact and Fast Sensitivity Oracles for Single-Source Distances. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | STACS | Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | ESA | Improved Purely Additive Fault-Tolerant Spanners. | Davide Bil, Fabrizio Grandoni, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SIROCCO | A Faster Computation of All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | ESA | Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SPAA | Locality-based network creation games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SIROCCO | Network Creation Games with Traceroute-Based Strategies. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2013 | Algosensors | Polygon-Constrained Motion Planning Problems. | Davide Bil, Yann Disser, Luciano Gual, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2013 | COCOON | New Bounds for the Balloon Popping Problem. | Davide Bil, Vittorio Bil |
| 2013 | ESA | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. | Davide Bil, Luciano Gual, Guido Proietti |
| 2013 | SIROCCO | Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2012 | MFCS | New Advances in Reoptimizing the Minimum Steiner Tree Problem. | Davide Bil, Anna Zych |
| 2011 | SIROCCO | Network Verification via Routing Table Queries. | Evangelos Bampas, Davide Bil, Guido Drovandi, Luciano Gual, Ralf Klasing, Guido Proietti |
| 2010 | MFCS | Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. | Davide Bil, Luciano Gual, Guido Proietti |
| 2010 | MFCS | Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. | Davide Bil, Luciano Gual, Guido Proietti |
| 2009 | CPM | Reoptimization of the Shortest Common Superstring Problem. | Davide Bil, Hans-Joachim Bckenhauer, Dennis Komm, Richard Krlovic, Tobias Mmke, Sebastian Seibert, Anna Zych |
| 2009 | SIROCCO | Reconstructing Visibility Graphs with Simple Robots. | Davide Bil, Yann Disser, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2009 | SIROCCO | Stability of Networks in Stretchable Graphs. | Davide Bil, Michael Gatto, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2008 | SIROCCO | Discovery of Network Properties with All-Shortest-Paths Queries. | Davide Bil, Thomas Erlebach, Mats Mihalk, Peter Widmayer |
| 2008 | WAOA | Reoptimization of Weighted Graph and Covering Problems. | Davide Bil, Peter Widmayer, Anna Zych |
| 2008 | WG | Approximating the Metric TSP in Linear Time. | Davide Bil, Luca Forlizzi, Guido Proietti |
| 2007 | ISAAC | Locating Facilities on a Network to Minimize Their Average Service Radius. | Davide Bil, Jrg Derungs, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2007 | PODC | An algorithm composition scheme preserving monotonicity. | Davide Bil, Luca Forlizzi, Luciano Gual, Guido Proietti |
| 2006 | Algosensors | On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. | Davide Bil, Guido Proietti |
| 2006 | SIROCCO | On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. | Davide Bil, Luciano Gual, Guido Proietti |
| 2005 | SIROCCO | Range Augmentation Problems in Static Ad-Hoc Wireless Networks. | Davide Bil, Guido Proietti |
| 2004 | ISAAC | Augmenting the Edge-Connectivity of a Spider Tree. | Davide Bil, Guido Proietti |
| 2004 | WAOA | A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. | Davide Bil, Guido Proietti |