Maximilian Probst

Maximilian Probst is a Lecturer at ETH Zürich's Department of Computer Science, affiliated with Rasmus Kyng's Algorithms and Optimization Group. He holds a Ph.D. from the University of Copenhagen (2020) and has conducted research at MIT. His research focuses on graph algorithms, dynamic networks, and optimization, with notable contributions to expander decomposition and network flow algorithms. Probst has received prestigious awards including the 2023 Frontiers of Science Award and the 2022 FOCS Best Paper Award.

Education: Ph.D. in Computer Science (2020), University of Copenhagen; M.Sc. in Computer Science, University of Copenhagen. Supervisors: Christian Wulff-Nilsen and Mikkel Thorup.

Research Interests: Graph Algorithms (Dynamic, Expander-based), Network Flows, Convex Optimization, and Algorithm Design. His work emphasizes theoretical guarantees for real-world graph problems, particularly in dynamic environments.

Publications: Probst's work spans foundational algorithmic breakthroughs, including nearly-linear-time maximum flow algorithms and dynamic graph sparsification techniques. His research bridges theory and practice, with applications in routing, congestion balancing, and expander decomposition.

Awards:

• Frontiers of Science Award (2023)
• FOCS Best Paper (2022)
• ESA Best Student Paper (2018)

Teaching: Co-instructor for courses like 'Advanced Graph Algorithms and Optimization' and 'Advanced Algorithms' at ETH Zurich.

Lab/Team: Member of the Algorithms and Optimization Group, collaborating closely with Rasmus Kyng and leading Ph.D. students in theoretical computer science.