No. Title Author Year
1 A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners BilÚ, Davide et al. 2018
2 Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees BilÚ, Davide 2018
3 Efficient Oracles and Routing Schemes for Replacement Paths BilÚ, Davide et al. 2018
4 New algorithms for Steiner tree reoptimization BilÚ, Davide 2018
5 On the Complexity of Two Dots for Narrow Boards and Few Colors BilÚ, Davide et al. 2018
6 On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games BilÚ, Davide et al. 2018
7 On the Tree Conjecture for the Network Creation Game BilÚ, Davide et al. 2018
8 An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner BilÚ, Davide et al. 2017
9 Compact and Fast Sensitivity Oracles for Single-Source Distances Bilo, Davide et al. 2016
10 Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees BilÚ, Davide et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Imprint | Privacy Published by LZI