Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier

von Kyng, Rasmus
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 5 of 5 (2022)

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

von Das, Debarati
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 5 of 5 (2022)

Maintaining Expander Decompositions via Sparse Cuts

von Hua, Yiding
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners

von Bergamaschi, Thiago
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)