Rasmus Kyng

Rasmus Kyng is an Assistant Professor at the Department of Computer Science, ETH Zurich, since Fall 2019. He focuses on developing fast algorithms for graph problems, convex optimization, and structured linear equations, with a specialization in fine-grained complexity theory and dynamic graph algorithms.

• Assistant Professor, Department of Computer Science, ETH Zurich (2019–present)
• Postdoc, Theory of Computation Group, Harvard (2018–2019)
• Research Fellow, Simons Institute, UC Berkeley (Fall 2017)

His research explores the intersection of graph algorithms, optimization, and complexity, particularly through dynamic graph data structures, sparsification, and applications in machine learning. Recent work includes breakthroughs in almost-linear time algorithms for network flow problems.

Key trends in his publications include:

• Advancements in dynamic graph algorithms and data structures
• Applications of convex optimization to graph theory
• Connections between matrix theory and algorithmic efficiency
• Derandomization techniques for algorithmic speed
• Expander graph-based oblivious routing
• Sparsification and low-congestion vertex sparsifiers

Scientific recognition includes the FOCS Best Paper Award (2022), ICBS Frontiers of Science Award (2022), and the Machtey Award for Best Student Paper (2017).

His group mentors PhD candidates and postdocs, including Ming Ding, Federico Soldà, Simon Meierhans, Aurelio Sulser, and Wuwei Yuan. Research is supported by Swiss National Science Foundation grants (project no. 200021 204787, starting grant no. TMSGI2 218022).