Sebastian Forster

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 39

Top Topics

Incremental Update

Carnegie Mellon University

Top Venues

Publications

Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
On Dynamic Graph Algorithms with Predictions. SODA (2024)
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP (2024)
Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
-center on graphs. SODA (2024)
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
Fast 2-Approximate All-Pairs Shortest Paths. SODA (2024)
Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. STOC (2023)
Sebastian Forster, Tijn de Vos
Faster Cut Sparsification of Weighted Graphs. Algorithmica 85 (4) (2023)
Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Bootstrapping Dynamic Distance Oracles. CoRR (2023)
Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
On Dynamic Graph Algorithms with Predictions. CoRR (2023)
Sebastian Forster, Tijn de Vos
The Laplacian Paradigm in Deterministic Congested Clique. CoRR (2023)
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
Fast 2-Approximate All-Pairs Shortest Paths. CoRR (2023)
Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Dynamic algorithms for k-center on graphs. CoRR (2023)
Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Bootstrapping Dynamic Distance Oracles. ESA (2023)
Sebastian Forster, Tijn de Vos
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. PODC (2023)
Sebastian Forster, Antonis Skarlatos, Tijn de Vos
Fast Algorithms for Energy Games in Special Cases. CoRR (2023)
Sebastian Forster, Tijn de Vos
The Laplacian Paradigm in the Broadcast Congested Clique. PODC (2022)
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR (2022)
Sebastian Forster, Tijn de Vos
The Laplacian Paradigm in the Broadcast Congested Clique. CoRR (2022)
Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12 (11) (2022)
Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. CoRR (2022)
Sebastian Forster, Tijn de Vos
Faster Cut Sparsification of Weighted Graphs. ICALP (2022)
Jan van den Brand, Sebastian Forster, Yasamin Nazari
Fast Deterministic Fully Dynamic Distance Approximation. FOCS (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2021)
Aaron Bernstein, Sebastian Forster, Monika Henzinger
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms 17 (4) (2021)
Sebastian Forster, Gramoz Goranci, Monika Henzinger
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA (2021)
Sebastian Forster, Martin Grösbacher, Tijn de Vos
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. CoRR (2021)
Jan van den Brand, Sebastian Forster, Yasamin Nazari
Fast Deterministic Fully Dynamic Distance Approximation. CoRR (2021)
Sebastian Forster, Martin Grösbacher, Tijn de Vos
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. OPODIS (2021)
Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. 50 (3) (2021)
Sebastian Forster, Tijn de Vos
Faster Cut Sparsification of Weighted Graphs. CoRR (2021)
Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. SODA (2020)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR (2020)
Sebastian Forster, Gramoz Goranci, Monika Henzinger
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR (2020)
Sebastian Forster, Gramoz Goranci
Dynamic low-stretch trees via dynamic low-diameter decompositions. STOC (2019)
Sebastian Forster, Liu Yang
A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems. CoRR (2019)
Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR (2019)
Aaron Bernstein, Sebastian Forster, Monika Henzinger
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. SODA (2019)
Sebastian Forster, Danupon Nanongkai
A Faster Distributed Single-Source Shortest Paths Algorithm. FOCS (2018)
Aaron Bernstein, Sebastian Forster, Monika Henzinger
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. CoRR (2018)