Follow
Maximilian Probst Gutenberg
Maximilian Probst Gutenberg
Verified email at inf.ethz.ch - Homepage
Title
Cited by
Cited by
Year
Maximum flow and minimum-cost flow in almost-linear time
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
221*2022
Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing
A Bernstein, MP Gutenberg, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
572020
Deterministic decremental sssp and approximate min-cost flow in almost-linear time
A Bernstein, MP Gutenberg, T Saranurak
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
562022
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
542020
Decremental strongly-connected components and single-source reachability in near-linear time
A Bernstein, M Probst, C Wulff-Nilsen
Proceedings of the 51st Annual ACM SIGACT Symposium on theory of computing …, 2019
392019
Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds
MP Gutenberg, C Wulff-Nilsen
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
382020
Deterministic algorithms for decremental approximate shortest paths: Faster and simpler
MP Gutenberg, C Wulff-Nilsen
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
362020
Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary
MP Gutenberg, C Wulff-Nilsen
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
352020
New techniques and fine-grained hardness for dynamic near-additive spanners
T Bergamaschi, M Henzinger, MP Gutenberg, VV Williams, N Wein
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
322021
Near-optimal decremental SSSP in dense weighted digraphs
A Bernstein, MP Gutenberg, C Wulff-Nilsen
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
322020
New algorithms and hardness for incremental single-source shortest paths in directed graphs
M Probst Gutenberg, V Vassilevska Williams, N Wein
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
322020
Decremental APSP in unweighted digraphs versus an adaptive adversary
J Evald, V Fredslund-Hansen, MP Gutenberg, C Wulff-Nilsen
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
20*2021
A deterministic almost-linear time algorithm for minimum-cost flow
J van den Brand, L Chen, MP Gutenberg, R Kyng, YP Liu, R Peng, ...
64th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 2023
172023
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs
D Das, MP Gutenberg, C Wulff-Nilsen
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
72022
Maintaining expander decompositions via sparse cuts
Y Hua, R Kyng, MP Gutenberg, Z Wu
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
62023
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier∗
R Kyng, S Meierhans, MP Gutenberg
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
62022
Deterministic incremental APSP with polylogarithmic update time and stretch
S Forster, Y Nazari, M Probst Gutenberg
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1173-1186, 2023
5*2023
Derandomizing directed random walks in almost-linear time
R Kyng, S Meierhans, M Probst
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
52022
Hardness results for laplacians of simplicial complexes via sparse-linear equation complete gadgets
M Ding, R Kyng, MP Gutenberg, P Zhang
arXiv preprint arXiv:2202.05011, 2022
42022
On the complexity of the (approximate) nearest colored node problem
M Probst
arXiv preprint arXiv:1807.03721, 2018
42018
The system can't perform the operation now. Try again later.
Articles 1–20