Prof. Dr. Kleist is particularly enthusiastic about problems that concern graphs and/or geometry and are inspired by everyday life. These can be, for example, packing problems, geometric representations of data or reconfiguration problems. Questions of this kind belong to the areas of algorithmic geometry, geometric graph theory, graph drawing and geometric optimization. Prof. Dr. Kleist is also looking forward to new cooperation opportunities at the Golm campus and other science locations in the region.
In the next semester, Prof. Dr. Kleist will offer a module on algorithmic graph theory for bachelor's and master's students as well as seminars on packing problems. While graph theory algorithms are used to optimize traffic flows or to make decisions more efficiently and fairly, we encounter interesting packing problems in industries such as the clothing industry and logistics. In the coming semesters, she will be teaching basic courses such as Algorithms and Data Structures and Theoretical Computer Science 2, and is planning further advanced courses in the area of algorithms. These contexts also offer many opportunities for interesting questions for final theses.