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
Publications
17 items
Dynamic Connectivity, Minimum Spanning Tree, and 2-Edge Connectivity with Polylogarithmic Worst-Case Update Time
2026
Cited
0
Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm
2026
Cited
0
A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
2026
Cited
0
Partially-Dynamic All-Pairs Maxflow and Effective Resistance via Stable Sparsifiers
2026
Cited
0
An Online Sparsification Algorithm from the Book
2026
Cited
0
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
Load more
Co-authors
17 total
Rasmus Kyng
ETH Zurich
Sushant Sachdeva
UToronto, Associate Professor. Vector Institute Affiliate
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
Jan van den Brand
Georgia Tech
