Sebastian Forster

46 papers A* 16A 3B 1Journal 25Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Fully Dynamic Spectral Sparsification for Directed Hypergraphs. STACS Sebastian Forster, Gramoz Goranci, Ali Momeni
2026	J	`jnl`	Incremental (k, z)-Clustering on Graphs. CoRR Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
2025	A*	`conf`	Dynamic Consistent SODA Sebastian Forster, Antonis Skarlatos
2025	J	`jnl`	Fully Dynamic Spectral Sparsification for Directed Hypergraphs. CoRR Sebastian Forster, Gramoz Goranci, Ali Momeni
2025	J	`jnl`	Greedy Algorithms for Shortcut Sets and Hopsets. CoRR Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, Yasamin Nazari
2025	A	`conf`	Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders. DISC Emilio Cruciani, Sebastian Forster, Tijn de Vos
2025	J	`jnl`	Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders. CoRR Emilio Cruciani, Sebastian Forster, Tijn de Vos
2024	J	`jnl`	Dynamic Consistent CoRR Sebastian Forster, Antonis Skarlatos
2024	A*	`conf`	Dynamic algorithms for SODA Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2024	A*	`conf`	Fast 2-Approximate All-Pairs Shortest Paths. SODA Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2024	A*	`conf`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2024	A*	`conf`	On Dynamic Graph Algorithms with Predictions. SODA Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2023	A	`conf`	Bootstrapping Dynamic Distance Oracles. ESA Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	J	`jnl`	Bootstrapping Dynamic Distance Oracles. CoRR Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	A*	`conf`	Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. PODC Sebastian Forster, Tijn de Vos
2023	A*	`conf`	Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. STOC Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
2023	J	`jnl`	Dynamic algorithms for k-center on graphs. CoRR Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	J	`jnl`	Fast 2-Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2023	—	`conf`	Fast Algorithms for Energy Games in Special Cases. GandALF Sebastian Forster, Antonis Skarlatos, Tijn de Vos
2023	J	`jnl`	Faster Cut Sparsification of Weighted Graphs. Algorithmica Sebastian Forster, Tijn de Vos
2023	J	`jnl`	On Dynamic Graph Algorithms with Predictions. CoRR Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2023	J	`jnl`	The Laplacian Paradigm in Deterministic Congested Clique. CoRR Sebastian Forster, Tijn de Vos
2022	J	`jnl`	Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. CoRR Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
2022	J	`jnl`	Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
2022	A*	`conf`	Fast Deterministic Fully Dynamic Distance Approximation. FOCS Jan van den Brand, Sebastian Forster, Yasamin Nazari
2022	A*	`conf`	Faster Cut Sparsification of Weighted Graphs. ICALP Sebastian Forster, Tijn de Vos
2022	J	`jnl`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2022	A*	`conf`	The Laplacian Paradigm in the Broadcast Congested Clique. PODC Sebastian Forster, Tijn de Vos
2022	J	`jnl`	The Laplacian Paradigm in the Broadcast Congested Clique. CoRR Sebastian Forster, Tijn de Vos
2021	J	`jnl`	A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms Aaron Bernstein, Sebastian Forster, Monika Henzinger
2021	B	`conf`	An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. OPODIS Sebastian Forster, Martin Grösbacher, Tijn de Vos
2021	J	`jnl`	An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. CoRR Sebastian Forster, Martin Grösbacher, Tijn de Vos
2021	A*	`conf`	Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA Sebastian Forster, Gramoz Goranci, Monika Henzinger
2021	J	`jnl`	Fast Deterministic Fully Dynamic Distance Approximation. CoRR Jan van den Brand, Sebastian Forster, Yasamin Nazari
2021	J	`jnl`	Faster Cut Sparsification of Weighted Graphs. CoRR Sebastian Forster, Tijn de Vos
2021	A*	`conf`	Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2021	J	`jnl`	Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen
2020	A*	`conf`	Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. SODA Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020	J	`jnl`	Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR Sebastian Forster, Gramoz Goranci, Monika Henzinger
2020	J	`jnl`	Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2019	A*	`conf`	A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. SODA Aaron Bernstein, Sebastian Forster, Monika Henzinger
2019	J	`jnl`	A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems. CoRR Sebastian Forster, Liu Yang
2019	J	`jnl`	Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai
2019	A*	`conf`	Dynamic low-stretch trees via dynamic low-diameter decompositions. STOC Sebastian Forster, Gramoz Goranci
2018	J	`jnl`	A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. CoRR Aaron Bernstein, Sebastian Forster, Monika Henzinger
2018	A*	`conf`	A Faster Distributed Single-Source Shortest Paths Algorithm. FOCS Sebastian Forster, Danupon Nanongkai