Inhalt des Dokuments
Welcome
- © Copyright??
Our core research fields are:
- Parameterized Computational Complexity
- Structural Complexity
- NP-hard problems
- Exact Algorithms
- Graph Algorithms
- Combinatorial Algorithms
- Algorithmic Bioinformatics
- Computational Social Choice
| 10.12.2018- 14.12.2018 | FSTTCS 2018 | 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Ahmedabad, India. Junjie Luo will give a talk titled "Parameterized Dynamic Cluster Editing". |
| 16.12.2018- 19.12.2018 | ISAAC 2018 | 29th International Symposium on Algorithms and Computation, Jiaoxi, Taiwan. Leon Kellerhals will give a talk titled "An Adaptive Version of Brandes' Algorithm for Betweenness Centrality". Hendrik Molter will give a talk titled "Cluster Editing in Multi-Layer and Temporal Graphs". |
| 20.01.2019- 25.01.2019 | Dagstuhl Seminar | New Horizons in Parameterized Complexity, Schloss Dagstuhl, Germany. Rolf Niedermeier will attend. |
| 29.01.2019- 01.02.2019 | AAAI 2019 | 33rd AAAI Conference on Artificial Intelligence, Honolulu, USA. Till Fluschnik will give a talk titled "Fair Knapsack". Hendrik Molter will give a talk titled "Sliding Window Temporal Graph Coloring". |
| 04.02.2019- 08.02.2019 | Lorentz Center Workshop | Scheduling Meets Fixed-Parameter Tractability, Leiden, Netherlands. Rolf Niedermeier, Robert Bredereck and Dušan Knop will attend. |
| 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. |
| 15.09.2019- 20.09.2019 | Dagstuhl Seminar | Application-Oriented Computational Social Choice, Schloss Dagstuhl, Germany. Rolf Niedermeier is co-organizer and will attend, so will Robert Bredereck. |