Theoretical Computer Science
We are some 20 people including faculty, PhD students, scientific guests, and student researchers. Our main research area is algorithms, in particular computational geometry, with an emphasis on the analysis and the comparison of patterns and shapes with geometric methods.
Apart from these topics, the group offers others within teaching theoretical computer science, for example, complexity theory, combinatorics, or computability theory. Furthermore, courses are offered within areas of practical or applied computer science that have a geometric component, such as computer graphics, pattern recognition or computer vision.