Maximilian Probst Gutenberg
Orcid: 0000-0003-3522-156XAffiliations:
- ETH Zurich, Switzerland
According to our database1,
Maximilian Probst Gutenberg
authored at least 32 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Commun. ACM, December, 2023
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
CoRR, 2023
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications.
CoRR, 2023
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
CoRR, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the Advances in Information Retrieval, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs.
CoRR, 2020
New algorithms and hardness for incremental single-source shortest paths in directed graphs.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Decremental strongly-connected components and single-source reachability in near-linear time.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018