Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications

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

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

von Goranci, Gramoz
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)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing

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

FULLY DYNAMIC K-CENTER CLUSTERING IN LOW DIMENSIONAL METRICS

von Goranci, Gramoz
Veröffentlicht in SIAM Symposium on Algorithm Engineering and Experiments (2021 : Online) Symposium on Algorithm Engineering and Experiments (ALENEX21) (2021)

FASTER GRAPH EMBEDDINGS VIA COARSENING

von Fahrbach, Matthew
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 4 of 15 (2021)

Fully Dynamic Exact Edge Connectivity in Sublinear Time

von Goranci, Gramoz
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)

Fully Dynamic Algorithms for Euclidean Steiner Tree

von Chan, T.-H. Hubert
Veröffentlicht in International Conference and Workshops on Algorithms and Computation (18. : 2024 : Kanazawa) WALCOM: algorithms and computation (2024)