Maximilian Probst Gutenberg

Available identifiers

Publication	Date of Publication	Type
Incremental approximate maximum flow on undirected graphs in subpolynomial update time	2024-11-28	Paper
Incremental SSSP for sparse digraphs beyond the hopset barrier	2024-07-19	Paper
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs	2024-07-19	Paper
Hardness results for Laplacians of simplicial complexes via sparse-linear equation complete gadgets	2024-06-24	Paper
Maintaining expander decompositions via sparse cuts	2024-05-14	Paper
A simple algorithm for multiple-source shortest paths in planar digraphs	2024-05-14	Paper
A simple framework for finding balanced sparse cuts via APSP	2024-05-14	Paper
Deterministic incremental APSP with polylogarithmic update time and stretch	2024-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q6147366	2024-01-15	Paper
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time	2022-01-07	Paper
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler	2021-02-02	Paper
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary	2021-02-02	Paper
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds	2021-02-02	Paper
New algorithms and hardness for incremental single-source shortest paths in directed graphs	2021-01-19	Paper

This page was built for person: Maximilian Probst Gutenberg