Employees in the Algorithms and Complexity Section

The section tries to understand how efficiently computers can solve combinatorial problems. Most of the work is theoretical using the power of mathematics, yet we have a strong track record of impact on the real world, e.g., focusing some of our attention on problems recurring in machine learning and related applied areas.

Learn more about our research and teaching on our section website. 

Name	Title
Amik Raj Behera	PhD Fellow
Amir Yehudayoff	Professor
Anders Aamand	Postdoc
Anders David Engström	Visiting PhD Student
Andy Oertel	Visitor
David Rasmussen Lolck	PhD Fellow
Duri Andrea Janett	PhD Fellow
Florestan Robin Valentin M Brunck	PhD Fellow
Hanwen Zhang	PhD Fellow
Jack Tor Stade	PhD Student
Jacob Holm	Assistant Professor - Tenure Track
Jacob John Imola	Postdoc
Jakob Nordström	Professor
Jakub Tetek	Enrolled PhD Student
Joel Daniel Andersson	PhD Fellow
Jonas Conneryd	Visiting PhD Student
Jonas Østergaard Klausen	PhD Fellow
Lukas Retschmeier	PhD Fellow
Mads Vestergaard Jensen	PhD Student
Magnus Rahbek Dalgaard Hansen	Visiting PhD Student
Mikkel Thorup	Professor
Mikkel Vind Abrahamsen	Associate Professor - Promotion Programme
Noel Arteche	Guest Researcher
Nutan Limaye	Visitor
Prateek Dwivedi	Guest Researcher
Rasmus Pagh	Professor
Sampson Sze Chung Wong	Guest Researcher
Shuo Pang	Postdoc
Shuyi Yan	PhD Fellow
Sia Susanne Lykke Sejer	PhD Student
Srikanth Srinivasan	Associate Professor
Stephen Alstrup	Professor
Theo Borém Fabris	PhD Student
Tuukka Korhonen	Postdoc
Wietze Koops	Visiting PhD Student
Yassine Ghannane	PhD Fellow