Scholar
Maximilian Probst Gutenberg
Google Scholar ID: y9zzazsAAAAJ
ETH Zurich
(Dynamic) Graph Algorithms
Data Structures
Lower bounds
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,250
H-index
16
i10-index
19
Publications
20
Co-authors
31
list available
Contact
No contact links provided.
Publications
12 items
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
2026
Cited
0
An Approximation Algorithm for Graph Label Selection
2026
Cited
0
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
2026
Cited
0
A Simple Deterministic Reduction From Gomory-Hu Tree to Maxflow and Expander Decomposition
2025
Cited
0
Reviving Thorup's Shortcut Conjecture
2025
Cited
0
Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
2025
Cited
0
Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
2025
Cited
0
A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows
2025
Cited
0
Load more
Resume (English only)
Co-authors
31 total
Rasmus Kyng
ETH Zurich
Sushant Sachdeva
UToronto, Associate Professor. Vector Institute Affiliate
Co-author 3
Christian Wulff-Nilsen
Associate professor, Department of Computer Science, University of Copenhagen
Yang P. Liu
Professor of Computer Science, Carnegie Mellon University
Richard Peng
Carnegie Mellon University
Aaron Bernstein
Professor of Computer Science, Rutgers University
Thatchaphol Saranurak
University of Michigan
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up