On the Complexity of the (Approximate) Nearest Colored Node Problem. - Maximilian Probst (ESA, 2018)

Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time. - Aaron Bernstein; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SIAM J. Comput., 2019)

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2020)

Near-Optimal Decremental SSSP in Dense Weighted Digraphs. - Aaron Bernstein; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (FOCS, 2020)

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. - Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SODA, 2020)

Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. - Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SODA, 2020)

Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. - Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SODA, 2020)

New algorithms and hardness for incremental single-source shortest paths in directed graphs. - Maximilian Probst Gutenberg; Virginia Vassilevska Williams; Nicole Wein (STOC, 2020)

Decremental APSP in Directed Graphs Versus an Adaptive Adversary. - Jacob Evald; Viktor Fredslund-Hansen; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (CoRR, 2020)

Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs. - Maximilian Probst Gutenberg (CoRR, 2020)

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2021)

Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. - Jacob Evald; Viktor Fredslund-Hansen; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (ICALP, 2021)

New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. - Thiago Bergamaschi; Monika Henzinger; Maximilian Probst Gutenberg; Virginia Vassilevska Williams; Nicole Wein (SODA, 2021)

The Power of Anchor Text in the Neural Retrieval Era. - Maik Fröbe; Sebastian Günther 002; Maximilian Probst; Martin Potthast; Matthias Hagen (ECIR (1), 2022)

Derandomizing Directed Random Walks in Almost-Linear Time. - Rasmus Kyng; Simon Meierhans; Maximilian Probst (FOCS, 2022)

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 001 (ICALP, 2022)

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. - Ming Ding 005; Rasmus Kyng; Maximilian Probst Gutenberg; Peng Zhang 052 (ICALP, 2022)

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. - Debarati Das 001; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SODA, 2022)

Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. - Rasmus Kyng; Simon Meierhans; Maximilian Probst Gutenberg (SODA, 2022)

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. - Debarati Das 001; Evangelos Kipouridis; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SOSA, 2022)

Webis-MS-MARCO-Anchor-Texts-22. - Maik Fröbe; Sebastian Günther 002; Maximilian Probst; Martin Potthast; Matthias Hagen (Zenodo, 2022)

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. - Jan van den Brand; Li Chen 028; Richard Peng; Rasmus Kyng; Yang P. Liu; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (FOCS, 2023)

Maintaining Expander Decompositions via Sparse Cuts. - Yiding Hua; Rasmus Kyng; Maximilian Probst Gutenberg; Zihang Wu (SODA, 2023)

A Simple Framework for Finding Balanced Sparse Cuts via APSP. - Li Chen 028; Rasmus Kyng; Maximilian Probst Gutenberg; Sushant Sachdeva (SOSA, 2023)

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. - Sebastian Forster; Yasamin Nazari; Maximilian Probst Gutenberg (STOC, 2023)

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (Commun. ACM, 2023)

Practical Expander Decomposition. - Lars Gottesbüren; Nikos Parotsidis; Maximilian Probst Gutenberg (ESA, 2024)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg; Sushant Sachdeva (FOCS, 2024)

Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. - Arnold Filtser; Gramoz Goranci; Neel Patel; Maximilian Probst Gutenberg (FOCS, 2024)

Optimal Electrical Oblivious Routing on Expanders. - Cella Florescu; Rasmus Kyng; Maximilian Probst Gutenberg; Sushant Sachdeva (ICALP, 2024)

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (SODA, 2024)

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg (STOC, 2024)

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. - Rasmus Kyng; Simon Meierhans; Maximilian Probst Gutenberg (STOC, 2024)

A Simple and Near-Optimal Algorithm for Directed Expander Decompositions. - Aurelio L. Sulser; Maximilian Probst Gutenberg (CoRR, 2024)

Near-Optimal Algorithm for Directed Expander Decompositions. - Aurelio L. Sulser; Maximilian Probst Gutenberg (ICALP, 2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. - Daoyuan Chen; Simon Meierhans; Maximilian Probst Gutenberg; Thatchaphol Saranurak (SODA, 2025)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. - Simon Meierhans; Maximilian Probst Gutenberg; Thatchaphol Saranurak (CoRR, 2025)

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (J. ACM, 2025)

Deterministic Almost-Linear-Time Gomory-Hu Trees. - Amir Abboud; Rasmus Kyng; Jason Li 006; Debmalya Panigrahi; Maximilian Probst Gutenberg; Thatchaphol Saranurak; Weixuan Yuan; Wuwei Yuan (CoRR, 2025)