Algorithms and Complexity
Research group at IT University of Copenhagen

Current members

Former members

  • Thomas Dybdahl Ahle (Postdoc) until March 2020
  • Andreas Björklund (Associate Professor) until 2025
  • Fabrizio Boninsegna (Visiting PhD student) until 2024
  • Matteo Ceccarello (Postdoc) until September 2019
  • Tobias Lybecker Christiani (Postdoc)
  • Matteo Dusefante (Ph.D. Student)
  • Jes Frellsen (Associate Professor) until June 2019
  • Lars Jaffke (Postdoc) until 2024
  • Christian Janos Lebeda (Postdoc) until 2024
  • Troels Bjerre Lund (Associate Professor) until 2021
  • Nina Mesing Stausholm Nielsen (Ph.D. Student) until 2021
  • Jesper With Mikkelsen (Postdoc)
  • Ioana Oriana Bercea (Postdoc) until 2023
  • Rasmus Pagh (Professor) until December 2020
  • Ninh Dang Pham (Postdoc) until August 2016
  • Natalie Schluter (Associate Professor)
  • Francesco Silvestri (Postdoc) until December 2016
  • Johan von Tangen Sivertsen (Postdoc)
  • Matthew Skala (Postdoc) until August 2016
  • Alexander Theodor Bilde Pedersen (Research Assistant) until 2025

Contact

IT University of Copenhagen
Wing 4B

Rued Langgaards Vej 7
2300 København

Seminar

We have a weekly seminar all Mondays at 10:05, see seminar schedule for more information. Everyone is welcome.

Student projects

In the Algorithms and Complexity group at IT University of Copenhagen, we offer students a variety of different topics for their research projects as well as for their Bachelor's or Master's thesis. These range from algorithm engineering (implementing and testing algorithms), over theory (coming up with new results in algorithms and complexity), to visualization (visualizing existing algorithms, mostly for pedagogical purposes), and others!

For an incomplete list of currently offered topics, please look as the following document (requires ITU account):

Go to university-shared document