Topics

We mainly offer topics in the area of algorithmic cluster analysis. These have either a theoretical focus (design and theoretical analysis of algorithms) or a practical focus (design and experimental analysis of algorithms). In both cases, the thesis consists of a theoretical part, in which a known research result is discussed, and an own part, consisting of design and analysis.

General requirements

• Very good mathematical skills
• Interest in algorithmics, especially in algorithm design and analysis
• Previous knowledge of LaTeX, e.g. through a compulsory seminar at the chair, or the willingness to acquire LaTeX knowledge in a timely manner.
• Bachelor's degree: Successful completion of modules with a total of 10 CP with lecturers of the chair; AlDat does not count as it is a compulsory basic module. The combination "Algorithms for Graphs 1" + "Combinatorial Algorithms for Clustering Problems" is particularly suitable.
• Master's degree: Ideally, attendance of the lectures "Approximation Algorithms", "Approximation Algorithms for Clustering Problems" and project work at the chair. However, the requirements for the Master's program can also be discussed individually, since the course "Approximation Algorithms for Clustering Problems" is currently still offered irregularly.