| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers | Bilò, Davide et al. | 2022 |
| 2 | Cutting Bamboo down to Size | Bilò, Davide et al. | 2020 |
| 3 | Dual-Mode Greedy Algorithms Can Save Energy | Geissmann, Barbara et al. | 2019 |
| 4 | Efficient Oracles and Routing Schemes for Replacement Paths | Bilò, Davide et al. | 2018 |
| 5 | On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games | Bilò, Davide et al. | 2018 |
| 6 | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | Bilò, Davide et al. | 2017 |
| 7 | Compact and Fast Sensitivity Oracles for Single-Source Distances | Bilo, Davide et al. | 2016 |
| 8 | Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees | Bilò, Davide et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |