| No. |
Title |
Author |
Year |
| 1 |
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers |
Bilò, Davide et al. |
2022 |
| 2 |
Sparse Temporal Spanners with Low Stretch |
Bilò, Davide et al. |
2022 |
| 3 |
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees |
Gualà, Luciano et al. |
2021 |
| 4 |
Cutting Bamboo down to Size |
Bilò, Davide et al. |
2020 |
| 5 |
Dual-Mode Greedy Algorithms Can Save Energy |
Geissmann, Barbara et al. |
2019 |
| 6 |
Optimal Sorting with Persistent Comparison Errors |
Geissmann, Barbara et al. |
2019 |
| 7 |
Resilient Dictionaries for Randomly Unreliable Memory |
Leucci, Stefano et al. |
2019 |
| 8 |
Efficient Oracles and Routing Schemes for Replacement Paths |
Bilò, Davide et al. |
2018 |
| 9 |
On the Complexity of Two Dots for Narrow Boards and Few Colors |
Bilò, Davide et al. |
2018 |
| 10 |
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games |
Bilò, Davide et al. |
2018 |
| 11 |
Optimal Dislocation with Persistent Errors in Subquadratic Time |
Geissmann, Barbara et al. |
2018 |
| 12 |
Tracks from hell - when finding a proof may be easier than checking it |
Almanza, Matteo et al. |
2018 |
| 13 |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner |
Bilò, Davide et al. |
2017 |
| 14 |
Sorting with Recurrent Comparison Errors |
Geissmann, Barbara et al. |
2017 |
| 15 |
Compact and Fast Sensitivity Oracles for Single-Source Distances |
Bilo, Davide et al. |
2016 |
| 16 |
Large Peg-Army Maneuvers |
Gualà, Luciano et al. |
2016 |
| 17 |
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees |
Bilò, Davide et al. |
2016 |
| 18 |
Trainyard is NP-hard |
Almanza, Matteo et al. |
2016 |
