Davide Bilò - RankMe

159 papers A* 11A 13B 33C 3Misc 6Journal 81Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Complexity Thresholds for the Constrained Colored Token Swapping Problem. CoRR Davide Bilò, Stefano Leucci, Andrea Martinelli
2026	J	`jnl`	On the approximability of graph visibility problems. Theor. Comput. Sci. Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2025	—	`conf`	Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. ALGOWIN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2025	A*	`conf`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. AAAI Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2025	J	`jnl`	Finding diameter-reducing shortcuts in trees. J. Comput. Syst. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2025	B	`conf`	On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. ISAAC Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2025	J	`jnl`	On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. CoRR Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2025	B	`conf`	On the Approximability of Graph Visibility Problems. WALCOM Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2025	A	`conf`	Temporal Network Creation Games: The Impact of Non-Locality and Terminals. AAMAS Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2025	J	`jnl`	Uniform-budget solo chess with only rooks or only knights is hard. Theor. Comput. Sci. Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
2024	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2024	J	`jnl`	Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2024	J	`jnl`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Geometric Network Creation Games. SIAM J. Discret. Math. Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2024	A	`conf`	Graph Spanners for Group Steiner Distances. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
2024	J	`jnl`	Graph Spanners for Group Steiner Distances. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
2024	A*	`conf`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	New Algorithms for Steiner Tree Reoptimization. Algorithmica Davide Bilò
2024	—	`conf`	On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). ICTCS Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2024	J	`jnl`	On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2024	J	`jnl`	On the approximability of graph visibility problems. CoRR Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2024	Misc	`conf`	Swapping Mixed-Up Beers to Keep Them Cool. FUN Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci
2024	J	`jnl`	Temporal Network Creation Games: The Impact of Non-Locality and Terminals. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2024	B	`conf`	Temporal Queries for Dynamic Temporal Forests. ISAAC Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	J	`jnl`	Temporal queries for dynamic temporal forests. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	Misc	`conf`	Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
2023	A*	`conf`	Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	B	`conf`	Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	A*	`conf`	Fault-Tolerant ST-Diameter Oracles. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Fault-Tolerant ST-Diameter Oracles. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	B	`conf`	Finding Diameter-Reducing Shortcuts in Trees. WADS Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2023	J	`jnl`	Finding Diameter-Reducing Shortcuts in Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2023	J	`jnl`	Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2023	—	`conf`	Schelling Games with Continuous Types (short paper). ICTCS Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
2023	A*	`conf`	Schelling Games with Continuous Types. IJCAI Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
2023	J	`jnl`	Schelling Games with Continuous Types. CoRR Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
2023	A*	`conf`	Temporal Network Creation Games. IJCAI Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2023	J	`jnl`	Temporal Network Creation Games. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2022	J	`jnl`	Almost optimal algorithms for diameter-optimally augmenting trees. Theor. Comput. Sci. Davide Bilò
2022	C	`conf`	Blackout-Tolerant Temporal Spanners. ALGOSENSORS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	J	`jnl`	Cutting bamboo down to size. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2022	A*	`conf`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	J	`jnl`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	A	`conf`	Fixed-Parameter Sensitivity Oracles. ITCS Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2022	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2022	J	`jnl`	New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	A	`conf`	Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	A	`conf`	Sparse Temporal Spanners with Low Stretch. ESA Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	J	`jnl`	Sparse Temporal Spanners with Low Stretch. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	A*	`conf`	Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. IJCAI Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
2022	J	`jnl`	Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. CoRR Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
2022	J	`jnl`	Topological influence and locality in swap schelling games. Auton. Agents Multi Agent Syst. Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
2021	Misc	`conf`	Cutting Bamboo down to Size. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2021	J	`jnl`	Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	J	`jnl`	Fixed-Parameter Sensitivity Oracles. CoRR Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2021	J	`jnl`	Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms Davide Bilò, Luciano Gualà, Guido Proietti
2021	A	`conf`	Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	Network Creation Games with Traceroute-Based Strategies. Algorithms Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2021	B	`conf`	New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	A*	`conf`	Selfish Creation of Social Networks. AAAI Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
2021	B	`conf`	Space-Efficient Fault-Tolerant Diameter Oracles. MFCS Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	Space-Efficient Fault-Tolerant Diameter Oracles. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2020	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2020	J	`jnl`	Cutting Bamboo Down to Size. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2020	—	`conf`	Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
2020	J	`jnl`	Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
2020	J	`jnl`	On the Tree Conjecture for the Network Creation Game. Theory Comput. Syst. Davide Bilò, Pascal Lenzner
2020	J	`jnl`	Selfish Creation of Social Networks. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
2020	B	`conf`	Topological Influence and Locality in Swap Schelling Games. MFCS Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
2020	J	`jnl`	Topological Influence and Locality in Swap Schelling Games. CoRR Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
2020	J	`jnl`	Tracking routes in communication networks. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2019	B	`conf`	Geometric Network Creation Games. SPAA Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2019	J	`jnl`	Geometric Network Creation Games. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2019	B	`conf`	Tracking Routes in Communication Networks. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	B	`conf`	A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. ISAAC Davide Bilò, Kleitos Papadopoulos
2018	J	`jnl`	A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. CoRR Davide Bilò, Kleitos Papadopoulos
2018	B	`conf`	Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. ISAAC Davide Bilò
2018	J	`jnl`	Almost optimal algorithms for diameter-optimally augmenting trees. CoRR Davide Bilò
2018	J	`jnl`	An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs. CoRR Davide Bilò, Kleitos Papadopoulos
2018	A	`conf`	Efficient Oracles and Routing Schemes for Replacement Paths. STACS Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
2018	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	A*	`conf`	New algorithms for Steiner tree reoptimization. ICALP Davide Bilò
2018	J	`jnl`	New algorithms for Steiner tree reoptimization. CoRR Davide Bilò
2018	Misc	`conf`	On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
2018	Misc	`conf`	On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2018	A	`conf`	On the Tree Conjecture for the Network Creation Game. STACS Davide Bilò, Pascal Lenzner
2017	B	`conf`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	B	`conf`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	On the Tree Conjecture for the Network Creation Game. CoRR Davide Bilò, Pascal Lenzner
2016	A	`conf`	Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Locality-Based Network Creation Games. ACM Trans. Parallel Comput. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Locality-based Network Creation Games. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	A	`conf`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2015	B	`conf`	A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. Davide Bilò, Luciano Gualà, Guido Proietti
2015	A	`conf`	Improved Purely Additive Fault-Tolerant Spanners. ESA Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Improved Purely Additive Fault-Tolerant Spanners. CoRR Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Network verification via routing table queries. J. Comput. Syst. Sci. Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2015	J	`jnl`	New bounds for the balloon popping problem. J. Comb. Optim. Davide Bilò, Vittorio Bilò
2015	J	`jnl`	Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	The max-distance network creation game on general host graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	A	`conf`	Fault-Tolerant Approximate Shortest-Path Trees. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2014	B	`conf`	Locality-based network creation games. SPAA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	B	`conf`	Network Creation Games with Traceroute-Based Strategies. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	The Max-Distance Network Creation Game on General Host Graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	A	`conf`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA Davide Bilò, Luciano Gualà, Guido Proietti
2013	B	`conf`	Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	Misc	`conf`	New Bounds for the Balloon Popping Problem. COCOON Davide Bilò, Vittorio Bilò
2013	C	`conf`	Polygon-Constrained Motion Planning Problems. ALGOSENSORS Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
2012	—	`conf`	Bounded-Distance Network Creation Games. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2012	J	`jnl`	Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2012	B	`conf`	New Advances in Reoptimizing the Minimum Steiner Tree Problem. MFCS Davide Bilò, Anna Zych
2012	J	`jnl`	Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2012	—	`conf`	The Max-Distance Network Creation Game on General Host Graphs. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2011	J	`jnl`	Approximating the Metric TSP in Linear Time. Theory Comput. Syst. Davide Bilò, Luca Forlizzi, Guido Proietti
2011	J	`jnl`	Bounded-Distance Network Creation Games CoRR Davide Bilò, Luciano Gualà, Guido Proietti
2011	B	`conf`	Network Verification via Routing Table Queries. SIROCCO Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2011	J	`jnl`	New Reoptimization Techniques applied to Steiner Tree Problem. Electron. Notes Discret. Math. Anna Zych, Davide Bilò
2011	J	`jnl`	Reoptimization of the Shortest Common Superstring Problem. Algorithmica Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2010	J	`jnl`	Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2010	B	`conf`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	B	`conf`	Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	—	`conf`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2009	J	`jnl`	Dynamic mechanism design. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2009	J	`jnl`	Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. Davide Bilò, Luciano Gualà, Guido Proietti
2009	B	`conf`	Reconstructing Visibility Graphs with Simple Robots. SIROCCO Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2009	B	`conf`	Reoptimization of the Shortest Common Superstring Problem. CPM Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2009	B	`conf`	Stability of Networks in Stretchable Graphs. SIROCCO Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
2008	J	`jnl`	Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2008	B	`conf`	Approximating the Metric TSP in Linear Time. WG Davide Bilò, Luca Forlizzi, Guido Proietti
2008	—	`conf`	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
2008	B	`conf`	Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2008	J	`jnl`	On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. Davide Bilò, Guido Proietti
2008	—	`conf`	Reoptimization of Steiner Trees. SWAT Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
2008	B	`conf`	Reoptimization of Weighted Graph and Covering Problems. WAOA Davide Bilò, Peter Widmayer, Anna Zych
2007	A*	`conf`	An algorithm composition scheme preserving monotonicity. PODC Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	—	`conf`	Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	B	`conf`	Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
2006	—	`conf`	Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN Davide Bilò, Luciano Gualà, Guido Proietti
2006	—	`conf`	Dynamic Mechanism Design. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2006	C	`conf`	On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS Davide Bilò, Guido Proietti
2006	B	`conf`	On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO Davide Bilò, Luciano Gualà, Guido Proietti
2005	B	`conf`	Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO Davide Bilò, Guido Proietti
2004	B	`conf`	A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA Davide Bilò, Guido Proietti
2004	B	`conf`	Augmenting the Edge-Connectivity of a Spider Tree. ISAAC Davide Bilò, Guido Proietti