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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI