| No. |
Title |
Author |
Year |
| 1 |
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs |
Karczmarz, Adam et al. |
2023 |
| 2 |
On Fully Dynamic Strongly Connected Components |
Karczmarz, Adam et al. |
2023 |
| 3 |
Optimal Decremental Connectivity in Non-Sparse Graphs |
Aamand, Anders et al. |
2023 |
| 4 |
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems |
Karczmarz, Adam |
2021 |
| 5 |
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs |
Karczmarz, Adam et al. |
2021 |
| 6 |
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs |
Charalampopoulos, Panagiotis et al. |
2020 |
| 7 |
Min-Cost Flow in Unit-Capacity Planar Graphs |
Karczmarz, Adam et al. |
2019 |
| 8 |
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs |
Karczmarz, Adam et al. |
2019 |
| 9 |
Decremental SPQR-trees for Planar Graphs |
Holm, Jacob et al. |
2018 |
| 10 |
Improved Bounds for Shortest Paths in Dense Distance Graphs |
Gawrychowski, Pawel et al. |
2018 |
| 11 |
Contracting a Planar Graph Efficiently |
Holm, Jacob et al. |
2017 |
| 12 |
A Simple Mergeable Dictionary |
Karczmarz, Adam |
2016 |
