default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavide Bilò
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j33]Davide Bilò
:
New Algorithms for Steiner Tree Reoptimization. Algorithmica 86(8): 2652-2675 (2024)- [j32]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141: 103495 (2024) - [j31]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. SIAM J. Discret. Math. 38(1): 277-315 (2024) - [j30]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024) - [c71]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. ESA 2024: 25:1-25:17 - [c70]Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci:
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN 2024: 4:1-4:19 - [c69]Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci:
Swapping Mixed-Up Beers to Keep Them Cool. FUN 2024: 5:1-5:18 - [c68]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). ICTCS 2024: 219-224 - [i41]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR abs/2405.13875 (2024) - [i40]Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci:
On the approximability of graph visibility problems. CoRR abs/2407.00409 (2024) - [i39]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. CoRR abs/2407.01431 (2024) - [i38]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - [i37]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota:
Temporal queries for dynamic temporal forests. CoRR abs/2409.18750 (2024) - 2023
- [c67]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. ICALP 2023: 24:1-24:20 - [c66]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types (short paper). ICTCS 2023: 328-333 - [c65]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. IJCAI 2023: 2511-2519 - [c64]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types. IJCAI 2023: 2520-2527 - [c63]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c62]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [c61]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. WADS 2023: 164-178 - [i36]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR abs/2304.14184 (2023) - [i35]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. CoRR abs/2305.03697 (2023) - [i34]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types. CoRR abs/2305.06819 (2023) - [i33]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. CoRR abs/2305.07494 (2023) - [i32]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i31]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. CoRR abs/2305.17385 (2023) - [i30]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 abs/2307.11677 (2023) - 2022
- [j29]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological influence and locality in swap schelling games. Auton. Agents Multi Agent Syst. 36(2): 47 (2022) - [j28]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84(1): 37-59 (2022) - [j27]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting bamboo down to size. Theor. Comput. Sci. 909: 54-67 (2022) - [j26]Davide Bilò:
Almost optimal algorithms for diameter-optimally augmenting trees. Theor. Comput. Sci. 931: 31-48 (2022) - [j25]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932: 102-115 (2022) - [c60]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-Tolerant Temporal Spanners. ALGOSENSORS 2022: 31-44 - [c59]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. ESA 2022: 19:1-19:16 - [c58]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP 2022: 22:1-22:19 - [c57]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. IJCAI 2022: 81-87 - [c56]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [c55]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: 12:1-12:21 - [i29]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR abs/2204.10679 (2022) - [i28]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. CoRR abs/2204.12599 (2022) - [i27]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. CoRR abs/2206.11113 (2022) - 2021
- [j24]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms 14(1): 8 (2021) - [j23]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. Algorithms 14(2): 35 (2021) - [c54]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. AAAI 2021: 5185-5193 - [c53]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA 2021: 18:1-18:17 - [c52]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo down to Size. FUN 2021: 5:1-5:18 - [c51]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. MFCS 2021: 18:1-18:16 - [c50]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO 2021: 167-184 - [i26]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 abs/2106.12293 (2021) - [i25]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR abs/2106.15731 (2021) - [i24]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. CoRR abs/2107.03485 (2021) - [i23]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [j22]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): 279-299 (2020) - [j21]Davide Bilò, Pascal Lenzner:
On the Tree Conjecture for the Network Creation Game. Theory Comput. Syst. 64(3): 422-443 (2020) - [j20]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking routes in communication networks. Theor. Comput. Sci. 844: 1-15 (2020) - [c49]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS 2020: 15:1-15:15 - [c48]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological Influence and Locality in Swap Schelling Games. MFCS 2020: 15:1-15:15 - [i22]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo Down to Size. CoRR abs/2005.00168 (2020) - [i21]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological Influence and Locality in Swap Schelling Games. CoRR abs/2005.02752 (2020) - [i20]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR abs/2009.10988 (2020) - [i19]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. CoRR abs/2012.06203 (2020)
2010 – 2019
- 2019
- [c47]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking Routes in Communication Networks. SIROCCO 2019: 81-93 - [c46]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. SPAA 2019: 323-332 - [i18]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. CoRR abs/1904.07001 (2019) - 2018
- [j19]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018) - [c45]Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - [c44]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN 2018: 8:1-8:15 - [c43]Davide Bilò:
New algorithms for Steiner tree reoptimization. ICALP 2018: 19:1-19:14 - [c42]Davide Bilò, Kleitos Papadopoulos:
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. ISAAC 2018: 7:1-7:12 - [c41]Davide Bilò:
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. ISAAC 2018: 40:1-40:13 - [c40]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [c39]Davide Bilò, Pascal Lenzner:
On the Tree Conjecture for the Network Creation Game. STACS 2018: 14:1-14:15 - [i17]Davide Bilò:
New algorithms for Steiner tree reoptimization. CoRR abs/1804.10791 (2018) - [i16]Davide Bilò, Kleitos Papadopoulos:
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. CoRR abs/1807.01260 (2018) - [i15]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 abs/1807.03331 (2018) - [i14]Davide Bilò:
Almost optimal algorithms for diameter-optimally augmenting trees. CoRR abs/1809.08822 (2018) - 2017
- [c38]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: 14:1-14:13 - [c37]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: 303-317 - [i13]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR abs/1707.08861 (2017) - [i12]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 abs/1710.01516 (2017) - [i11]Davide Bilò, Pascal Lenzner:
On the Tree Conjecture for the Network Creation Game. CoRR abs/1710.01782 (2017) - 2016
- [j18]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652: 86-101 (2016) - [j17]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3(1): 6:1-6:26 (2016) - [c36]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA 2016: 13:1-13:14 - [c35]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS 2016: 18:1-18:14 - [i10]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1601.04169 (2016) - [i9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based Network Creation Games. CoRR abs/1607.06765 (2016) - [i8]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR abs/1608.04769 (2016) - 2015
- [j16]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015) - [j15]Davide Bilò, Vittorio Bilò:
New bounds for the balloon popping problem. J. Comb. Optim. 29(1): 182-196 (2015) - [j14]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network verification via routing table queries. J. Comput. Syst. Sci. 81(1): 234-248 (2015) - [j13]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562: 643-657 (2015) - [j12]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573: 43-53 (2015) - [j11]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3(3): 16:1-16:20 (2015) - [c34]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c33]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: 239-253 - [i7]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. CoRR abs/1507.00505 (2015) - 2014
- [j10]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68(2): 337-357 (2014) - [c32]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - [c31]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. SIROCCO 2014: 210-223 - [c30]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. SPAA 2014: 277-286 - [i6]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR abs/1407.0628 (2014) - [i5]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1407.0637 (2014) - [i4]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. CoRR abs/1407.0643 (2014) - [i3]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR abs/1407.1167 (2014) - 2013
- [c29]Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer:
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c28]Davide Bilò, Vittorio Bilò:
New Bounds for the Balloon Popping Problem. COCOON 2013: 5-16 - [c27]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA 2013: 157-168 - [c26]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO 2013: 322-333 - 2012
- [j9]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012) - [j8]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) - [c25]Davide Bilò, Anna Zych:
New Advances in Reoptimizing the Minimum Steiner Tree Problem. MFCS 2012: 184-197 - [c24]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. WINE 2012: 72-85 - [c23]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405 - 2011
- [j7]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) - [j6]Anna Zych, Davide Bilò:
New Reoptimization Techniques applied to Steiner Tree Problem. Electron. Notes Discret. Math. 37: 387-392 (2011) - [j5]Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011) - [c22]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network Verification via Routing Table Queries. SIROCCO 2011: 270-281 - [i2]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. CoRR abs/1112.4264 (2011) - 2010
- [j4]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) - [c21]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149 - [c20]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161 - [c19]