| No. |
Title |
Author |
Year |
| 1 |
A Local-To-Global Theorem for Congested Shortest Paths |
Akmal, Shyan et al. |
2023 |
| 2 |
Dynamic Graph Algorithms (Dagstuhl Seminar 22461) |
Bernstein, Aaron et al. |
2023 |
| 3 |
Hardness of Token Swapping on Trees |
Aichholzer, Oswin et al. |
2022 |
| 4 |
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost |
Berger, Aaron et al. |
2022 |
| 5 |
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial |
Morgan, Adir et al. |
2021 |
| 6 |
Lower Bounds for Dynamic Distributed Task Allocation |
Su, Hsin-Hao et al. |
2020 |
| 7 |
Algorithms and Hardness for Diameter in Dynamic Graphs |
Ancona, Bertie et al. |
2019 |
| 8 |
Approximation Algorithms for Min-Distance Problems |
Dalirrooyfard, Mina et al. |
2019 |
| 9 |
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems |
Dalirrooyfard, Mina et al. |
2019 |
| 10 |
Finding Cliques in Social Networks: A New Distribution-Free Model |
Fox, Jacob et al. |
2018 |
| 11 |
Fully Dynamic MIS in Uniformly Sparse Graphs |
Onak, Krzysztof et al. |
2018 |
| 12 |
Improved Dynamic Graph Coloring |
Solomon, Shay et al. |
2018 |
