Maximilian Probst Gutenberg
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
34
Venues
5
Active years
2020–2026
Best venue rank
A*
Where they publish
Papers
34 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root Depth. | Vikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | ICALP | Partially-Dynamic Maximum Flow in Dense Graphs. | Egor Kravchenko, Maximilian Probst Gutenberg |
| 2026 | SODA | A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows. | Maximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan |
| 2026 | SODA | Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time. | Simon Meierhans, Maximilian Probst Gutenberg |
| 2026 | SODA | Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. | Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | STOC | Reviving Thorup's Shortcut Conjecture. | Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller |
| 2025 | FOCS | Deterministic Almost-Linear-Time Gomory-Hu Trees. | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan |
| 2025 | FOCS | Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious Routings. | Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder |
| 2025 | ICALP | Near-Optimal Algorithm for Directed Expander Decompositions. | Aurelio L. Sulser, Maximilian Probst Gutenberg |
| 2025 | SODA | Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. | Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2024 | ESA | Practical Expander Decomposition. | Lars Gottesbren, Nikos Parotsidis, Maximilian Probst Gutenberg |
| 2024 | FOCS | Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | FOCS | Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. | Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg |
| 2024 | ICALP | Optimal Electrical Oblivious Routing on Expanders. | Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | SODA | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2024 | STOC | Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. | Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg |
| 2024 | STOC | A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
| 2023 | FOCS | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | SODA | Maintaining Expander Decompositions via Sparse Cuts. | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
| 2023 | STOC | Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. | Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg |
| 2022 | FOCS | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | ICALP | Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun |
| 2022 | ICALP | Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. | Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang |
| 2022 | SODA | A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. | Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2022 | SODA | Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
| 2021 | FOCS | Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2021 | ICALP | Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2021 | SODA | New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. | Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2020 | FOCS | Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2020 | FOCS | Near-Optimal Decremental SSSP in Dense Weighted Digraphs. | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | STOC | New algorithms and hardness for incremental single-source shortest paths in directed graphs. | Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |