TU Berlin

Algorithmics and Computational Complexity Research GroupAlgorithmics and Computational Complexity Research Group


Page Content

to Navigation



With great sadness, we announce that Prof. Rolf Niedermeier recently passed away unexpectedly at the age of 55. He was the founder and cornerstone of the AKT group, which he established at TU Berlin in 2010, after coming here from the University of Jena. Over his academic lifetime, he supervised thirty Doctoral and countless Bachelor and Master students, taught a variety of stimulating courses, and headed more than fifteen different DFG-funded research projects. Within the academic community, he was known as one of the leading figures in parameterized algorithmics, and also worked on problems from various fields such as computational social choice, temporal graph theory, and computational biology with tireless enthusiasm. Among his colleagues, students, and friends, Rolf was known to be warm-hearted, caring, and always in the mood for a witticism. Even though his passing leaves a large void, his influence will live on in all those who worked with him during his life.

We grieve for an inspiring mentor, bright scientist, supportive colleague, and good friend.

The AKT group

Our group will continue to teach and to supervise running Bachelor and Master theses. For further information on teaching we refer to the relevant ISIS courses. If you have any teaching-related questions please contact lehre'at'akt.tu-berlin.de.

Please note - bitte beachten:

Due to the continuing risk of infection with COVID-19, consultation hours of our group can only take place by prior appointment. Here you will find our contact details.

Current information from the examination service department can be found here.


Aufgrund des weiterhin bestehenden Infektionsrisikos mit COVID-19 können Sprechstunden unserer Gruppe nur nach vorheriger Terminvereinbarung stattfinden. Hier finden Sie unsere Kontaktdaten.

Aktuelle Informationen des Prüfungsamts finden sie hier.



Our core research fields are:

  • Parameterized Computational Complexity
  • Structural Complexity
  • NP-hard problems
  • Exact Algorithms
  • Graph Algorithms
  • Combinatorial Algorithms
  • Algorithmic Bioinformatics
  • Computational Social Choice

Upcoming events of special interest to our group
Guest professor Mathias Weller is new head of the group


Quick Access

Schnellnavigation zur Seite über Nummerneingabe