About us

In our group, we are dedicated to advancing theoretical computer science, in particular by developing and analyzing efficient algorithms for hard computational problems as well as establishing theoretical limits of algorithmic approaches. Our work deals with a wide range of fascinating areas including computational geometry, geometric graph theory, graph drawing and geometric optimization problems. Some of us are working on the application of expressive type systems in computer-aided theorem proving and in the development of correct-by-construction software.

In addition to our research activities we offer various courses in Theoretical Computer Science, both at basic and advanced levels, e.g., Algorithms and Data Structures, Efficient Algorithms, Algorithmic Graph Theory. Additionally, we supervise Bachelor, Master and Doctoral students in preparing their thesis on exciting question that involve algorithmic aspects.

We always strive to broaden our perspectives and exchange ideas. If you are interested in collaborating or have any questions, please get in touch.