TU Berlin

Research Group Algorithmics and Computational ComplexityAbschlussarbeiten


Page Content

to Navigation

Topics for Bachelor and Master Theses

Algorithms and complexity for NP-hard problems with a special focus an parameterized algorithmics. Application domains include networks (biological, social, ...), graph-based data clustering, graph modification problems, voting systems, and other combinatorial problems.


Currently we cannot supervise Bachelor or Master theses of students outside of Berlin.
We also do not offer internships and do not answer the corresponding emails.


Quick Access

Schnellnavigation zur Seite über Nummerneingabe