| 2026 | ESA | A General Reduction from Near-Additive Emulators to Near-Exact Hopsets. | Julian Aeri, Sebastian Forster, Mara Grilnberger |
| 2026 | ICALP | Incremental (k, z)-Clustering on Graphs. | Emilio Cruciani, Sebastian Forster, Antonis Skarlatos |
| 2026 | STACS | Fully Dynamic Spectral Sparsification for Directed Hypergraphs. | Sebastian Forster, Gramoz Goranci, Ali Momeni |
| 2025 | SODA | Dynamic Consistent | Sebastian Forster, Antonis Skarlatos |
| 2024 | ICALP | New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
| 2024 | SODA | On Dynamic Graph Algorithms with Predictions. | Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak |
| 2024 | SODA | Dynamic algorithms for | Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos |
| 2024 | SODA | Fast 2-Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos |
| 2023 | ESA | Bootstrapping Dynamic Distance Oracles. | Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos |
| 2023 | PODC | Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. | Sebastian Forster, Tijn de Vos |
| 2023 | STOC | Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. | Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg |
| 2022 | FOCS | Fast Deterministic Fully Dynamic Distance Approximation. | Jan van den Brand, Sebastian Forster, Yasamin Nazari |
| 2022 | ICALP | Faster Cut Sparsification of Weighted Graphs. | Sebastian Forster, Tijn de Vos |
| 2022 | PODC | The Laplacian Paradigm in the Broadcast Congested Clique. | Sebastian Forster, Tijn de Vos |
| 2021 | FOCS | Minor Sparsifiers and the Distributed Laplacian Paradigm. | Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye |
| 2021 | OPODIS | An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. | Sebastian Forster, Martin Grsbacher, Tijn de Vos |
| 2021 | SODA | Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. | Sebastian Forster, Gramoz Goranci, Monika Henzinger |
| 2020 | SODA | Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. | Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2019 | SODA | A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. | Aaron Bernstein, Sebastian Forster, Monika Henzinger |
| 2019 | STOC | Dynamic low-stretch trees via dynamic low-diameter decompositions. | Sebastian Forster, Gramoz Goranci |
| 2018 | FOCS | A Faster Distributed Single-Source Shortest Paths Algorithm. | Sebastian Forster, Danupon Nanongkai |