| No. |
Title |
Author |
Year |
| 1 |
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds |
Mathialagan, Surya et al. |
2022 |
| 2 |
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths |
Chan, Timothy M. et al. |
2021 |
| 3 |
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths |
Gu, Yuzhou et al. |
2021 |
| 4 |
Faster Dynamic Range Mode |
Sandlund, Bryce et al. |
2020 |
| 5 |
Approximation Algorithms for Min-Distance Problems |
Dalirrooyfard, Mina et al. |
2019 |
| 6 |
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures |
Chen, Lijie et al. |
2018 |
