Research output per year
Research output per year
- 11 results
Search results
-
2024
Dynamic algorithms for k-center on graphs
Cruciani, E., Forster, S., Goranci, G., Nazari, Y. & Skarlatos, A., 2024, p. 3441-3462. 22 p.Research output: Contribution to conference › Paper › peer-review
Open Access -
Fast 2-Approximate All-Pairs Shortest Paths
Dory, M., Forster, S., Kirkpatrick, Y., Nazari, Y., Vassilevska Williams, V. & de Vos, T., 2024, p. 4728--4757.Research output: Contribution to conference › Paper › peer-review
Open Access -
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
Dory, M., Forster, S., Nazari, Y. & de Vos, T., 2024, p. 58:1-58:19.Research output: Contribution to conference › Paper › peer-review
Open Access -
On Dynamic Graph Algorithms with Predictions
van den Brand, J., Forster, S., Nazari, Y. & Polak, A., 2024, p. 3534-3557. 24 p.Research output: Contribution to conference › Paper › peer-review
Open Access -
2023
Fast Algorithms for Energy Games in Special Cases
Forster, S., Skarlatos, A. & de Vos, T., 30 Sept 2023, Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification . Vol. 390. p. 236-252 17 p. (Electronic Proceedings in Theoretical Computer Science, EPTCS).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Bootstrapping Dynamic Distance Oracles
Forster, S., Goranci, G., Nazari, Y. & Skarlatos, A., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 50. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
Forster, S. & De Vos, T., 19 Jun 2023, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 75-78 4 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch
Forster, S., Nazari, Y. & Probst Gutenberg, M., 2 Jun 2023, Proceedings of the Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1173-1186 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
2022
Faster Cut Sparsification of Weighted Graphs
Forster, S. & de Vos, T., 1 Nov 2022, In: Algorithmica.Research output: Contribution to journal › Article › peer-review
Open Access -
Faster Cut Sparsification of Weighted Graphs
Forster, S. & de Vos, T., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Fast Deterministic Fully Dynamic Distance Approximation
Brand, J. V. D., Forster, S. & Nazari, Y., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 1011-1022 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access