Maximilian Probst Gutenberg
Maximilian Probst Gutenberg
ETH Zurich
Verified email at di.ku.dk - Homepage
Title
Cited by
Cited by
Year
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
222020
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
202020
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
192019
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
142020
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
142020
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
122020
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
92020
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
82020
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
4*2021
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
32021
On the complexity of the (approximate) nearest colored node problem
M Probst
arXiv preprint arXiv:1807.03721, 2018
22018
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
A Bernstein, MP Gutenberg, T Saranurak
arXiv preprint arXiv:2101.07149, 2021
2021
Advanced Graph Algorithms and Optimization
R Kyng, M Probst
2021
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
MP Gutenberg
arXiv preprint arXiv:2011.13702, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–14