TU Berlin

Research Group Algorithmics and Computational ComplexityResearch Group Algorithmics and Computational Complexity

isti-logo

Page Content

to Navigation

Welcome

Lupe

Our core research fields are:

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

Current and upcoming guests in Berlin
July - Sept 2019
Piotr Faliszewski (AGH University of Science and Technology, Krakow) is visiting our group as a winner of a Friedrich Wilhelm Bessel Research Award of the Alexander von Humboldt foundation.
Aug 2019 - Febr 2020
Mathias Weller (LIGM, Paris - Marne-La-Vallée) is visiting our group.
Upcoming events of special interest to our group
09.09.2019-
13.09.2019
ALGO 2019


19th ALGO Conference, Munich, Germany. Till Fluschnik will attend and Philipp Zschoche will give a talk titled Multistage Vertex Cover at IPEC 2019.
15.09.2019-
20.09.2019
Dagstuhl Seminar
Application-Oriented Computational Social Choice, Schloss Dagstuhl, Germany. Rolf Niedermeier is co-organizer and will attend.
10.10.2019-
11.10.2019
Theorietag
Our group organizes the 78th Workshop about Algorithms and Complexity
10.10.2019-
11.10.2019
MATCOS 2019
Middle-European Conference on Applied Theoretical Computer Science, Koper, Slovenia. Rolf Niedermeier is member of the program committee.
25.10.2019-
27.10.2019
ADT 2019
6th Conference on Algorithmic Decision Theory, Durham, NC, USA. Robert Bredereck is member of the program committee.
27.10.2019-
31.10.2019
Dagstuhl
Seminar
Algorithms and Complexity in Phylogenetics, Schloss Dagstuhl, Germany. Rolf Niedermeier is co-organizer and will attend.
20.01.2020-
24.01.2020
SOFSEM 2020
46th International Conference on Current Trends in Theory and Practice of Computer Science, Limassol, Cyprus. Rolf Niedermeier is member of the program committee.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe