TU Berlin

Research Group Algorithmics and Computational ComplexityResearch Group Algorithmics and Computational Complexity

isti-logo

Inhalt

zur Navigation

Es gibt keine deutsche Übersetzung dieser Webseite.

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

Upcoming events of special interest to our group
04.03.2019-
08.03.2019
Shonan Seminar
Parameterized Graph Algorithms&Data Reduction: Theory Meets Practice Shonan, Japan. Matthias Bentert and André Nichterlein will attend.
13.03.2019-
16.03.2019
STACS 2019
36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany. The research group AKT organizes the event.
13.05.2019-
17.05.2019
AAMAS 2019
18th International Conference on Autonomous Agents and Multiagent Systems, Montreal, Canada. Robert Bredereck and Dušan Knop are part of the programming committee.
27.05.2019-
29.05.2019
CIAC 2019
11th International Conference on Algorithms and Complexity, Rome, Italy.
Matthias Bentent and Philipp Zschoche will give a talk titled Parameterized Complexity of Diameter.
15.09.2019-
20.09.2019
Dagstuhl Seminar
Application-Oriented Computational Social Choice, Schloss Dagstuhl, Germany. Rolf Niedermeier is co-organizer and will attend.

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe