| No. |
Title |
Author |
Year |
| 1 |
Fault-Tolerant ST-Diameter Oracles |
Bilò, Davide et al. |
2023 |
| 2 |
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances |
Bilò, Davide et al. |
2022 |
| 3 |
Fixed-Parameter Sensitivity Oracles |
Bilò, Davide et al. |
2022 |
| 4 |
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers |
Bilò, Davide et al. |
2022 |
| 5 |
Sparse Temporal Spanners with Low Stretch |
Bilò, Davide et al. |
2022 |
| 6 |
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles |
Bilò, Davide et al. |
2021 |
| 7 |
Space-Efficient Fault-Tolerant Diameter Oracles |
Bilò, Davide et al. |
2021 |
| 8 |
Cutting Bamboo down to Size |
Bilò, Davide et al. |
2020 |
| 9 |
Fair Tree Connection Games with Topology-Dependent Edge Cost |
Bilò, Davide et al. |
2020 |
| 10 |
Topological Influence and Locality in Swap Schelling Games |
Bilò, Davide et al. |
2020 |
| 11 |
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners |
Bilò, Davide et al. |
2018 |
| 12 |
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees |
Bilò, Davide |
2018 |
| 13 |
Efficient Oracles and Routing Schemes for Replacement Paths |
Bilò, Davide et al. |
2018 |
| 14 |
New algorithms for Steiner tree reoptimization |
Bilò, Davide |
2018 |
| 15 |
On the Complexity of Two Dots for Narrow Boards and Few Colors |
Bilò, Davide et al. |
2018 |
| 16 |
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games |
Bilò, Davide et al. |
2018 |
| 17 |
On the Tree Conjecture for the Network Creation Game |
Bilò, Davide et al. |
2018 |
| 18 |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner |
Bilò, Davide et al. |
2017 |
| 19 |
Compact and Fast Sensitivity Oracles for Single-Source Distances |
Bilo, Davide et al. |
2016 |
| 20 |
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees |
Bilò, Davide et al. |
2016 |
