default search action
Davide 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ò
Geometric Network Creation Games. SIAM J. Discret. Math. 38(1): 277-315 (2024) - [j30]Davide Bilò
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
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
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c62]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [c61]Davide Bilò
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
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84(1): 37-59 (2022) - [j27]Davide Bilò
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ò
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932: 102-115 (2022) - [c60]Davide Bilò
Blackout-Tolerant Temporal Spanners. ALGOSENSORS 2022: 31-44 - [c59]Davide Bilò, Gianlorenzo D'Angelo
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
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [c55]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti
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
Sparse Temporal Spanners with Low Stretch. CoRR abs/2206.11113 (2022) - 2021
- [j24]Davide Bilò
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ò
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ò
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ò
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ò
Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS 2020: 15:1-15:15 - [c48]Davide Bilò
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ò
Tracking Routes in Communication Networks. SIROCCO 2019: 81-93 - [c46]Davide Bilò
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ò
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018) - [c45]Davide Bilò
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - [c44]Davide Bilò
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ò
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ò
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [c39]Davide Bilò
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ò
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC 2017: 14:1-14:13 - [c37]Davide Bilò
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ò
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
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3(1): 6:1-6:26 (2016) - [c36]Davide Bilò
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA 2016: 13:1-13:14 - [c35]Davide Bilò
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ò
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015) - [j15]Davide Bilò
New bounds for the balloon popping problem. J. Comb. Optim. 29(1): 182-196 (2015) - [j14]Evangelos Bampas
Network verification via routing table queries. J. Comput. Syst. Sci. 81(1): 234-248 (2015) - [j13]Davide Bilò
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562: 643-657 (2015) - [j12]Davide Bilò
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573: 43-53 (2015) - [j11]Davide Bilò
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3(3): 16:1-16:20 (2015) - [c34]Davide Bilò
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c33]Davide Bilò
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ò
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68(2): 337-357 (2014) - [c32]Davide Bilò
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - [c31]Davide Bilò
Network Creation Games with Traceroute-Based Strategies. SIROCCO 2014: 210-223 - [c30]Davide Bilò
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ò
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c28]Davide Bilò
New Bounds for the Balloon Popping Problem. COCOON 2013: 5-16 - [c27]Davide Bilò
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA 2013: 157-168 - [c26]Davide Bilò
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO 2013: 322-333 - 2012
- [j9]Davide Bilò
Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012) - [j8]Davide Bilò
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012) - [c25]Davide Bilò
New Advances in Reoptimizing the Minimum Steiner Tree Problem. MFCS 2012: 184-197 - [c24]Davide Bilò
Bounded-Distance Network Creation Games. WINE 2012: 72-85 - [c23]Davide Bilò
The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405 - 2011
- [j7]Davide Bilò
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ò
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011) - [c22]Evangelos Bampas
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ò
Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010) - [c21]Davide Bilò
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149 - [c20]Davide Bilò
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161 - [c19]Davide Bilò
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86
2000 – 2009
- 2009
- [j3]Davide Bilò
Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009) - [c18]Davide Bilò
Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91 - [c17]Davide Bilò
Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 - [c16]Davide Bilò
Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112 - [i1]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Davide Bilò
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. 5(4): 411-437 (2008) - [j1]Davide Bilò
On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1): 43-55 (2008) - [c15]Davide Bilò
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 - [c14]Davide Bilò
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - [c13]Davide Bilò
Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213 - [c12]Davide Bilò
Approximating the Metric TSP in Linear Time. WG 2008: 43-54 - [c11]Davide Bilò
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262 - 2007
- [c10]Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598 - [c9]Davide Bilò
An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361 - [c8]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514 - 2006
- [c7]Davide Bilò
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24 - [c6]Davide Bilò
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30 - [c5]Davide Bilò, Luciano Gualà, Guido Proietti
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309 - [c4]Davide Bilò
Dynamic Mechanism Design. WINE 2006: 3-15 - 2005
- [c3]Davide Bilò, Guido Proietti
Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64 - 2004
- [c2]Davide Bilò, Guido Proietti
Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171 - [c1]Davide Bilò, Guido Proietti
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA 2004: 181-196
Coauthor Index
[j32] [c71] [c70] [c69] [i39] [i37] [c61] [i31] [j28] [j27] [j25] [c60] [c59] [c55] [i27] [j24] [j23] [c52] [c50] [i26] [j22] [j20] [i22] [c47] [j19] [c45] [c44] [c40] [c38] [c37] [i13] [i12] [j18] [j17] [c36] [c35] [i10] [i9] [i8] [j16] [j14] [j13] [j12] [j11] [c34] [c33] [i7] [j10] [c32] [c31] [c30] [i6] [i5] [i4] [i3] [c29] [c27] [c26] [j9] [c24] [c23] [c22] [i2] [c21] [c20] [c19] [j3] [c16] [i1] [j2] [c11] [c10] [c9] [c8] [c6] [c5] [c4]
[j32] [c71] [c70] [c69] [c68] [i41] [i40] [i39] [i37] [c61] [i31] [j28] [j27] [j25] [c60] [c59] [c55] [i27] [j23] [c52] [c50] [i26] [j22] [j20] [i22] [c47] [j19] [c45] [c44] [c40] [c38] [c37] [i13] [i12] [j18] [j17] [c36] [c35] [i10] [i9] [i8] [j13] [j12] [c34] [c33] [i7] [c32] [c31] [c30] [i6] [i5] [i4] [i3] [c26] [c23] [c19]
[i37] [j28] [j27] [j25] [c55] [j24] [j23] [c52] [c50] [i26] [j22] [j20] [i22] [c47] [j19] [c44] [c40] [c38] [c37] [i13] [i12] [j18] [j17] [c36] [c35] [i10] [i9] [i8] [j16] [j14] [j13] [j12] [j11] [c34] [c33] [i7] [j10] [c32] [c31] [c30] [i6] [i5] [i4] [i3] [c29] [c27] [c26] [j9] [c24] [c23] [j5] [c22] [i2] [c21] [c20] [c19] [j3] [c16] [i1] [j2] [j1] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: