Advanced Graph Algorithms

PhD level class on graph algorithms. Main topics covered:
- dynamic graph data structures (link-cut trees, ET trees, top trees, dynamic connectivity)
- multiplicative weight update algorithm with applications in graph algorithms
- interior point methods in graph algorithms
- practical network flow algorithms
- current research topics in graph algorithms

Target group: PhD students in theoretical computer science

Prerequisites: Undergraduate-level class on graph algorithms and data structures

Evaluation: homework and project

Teaching format: lectures

ECTS: 6 Year: 2026

Track segment(s):
Elective

Teacher(s):
Monika Henzinger Vladimir Kolmogorov

Teaching assistant(s):
Pavel Arkhipov