AG Theoretische Informatik

Our research group focuses on the design of efficient algorithms for graph problems. Many important problems are hard to solve in general, hence we try to identify the most general graph classes on which tractability can be achieved. We are also interested in logical methods in computer science. One problem of particular interest is the model-checking problem for first-order logic. In this context we currently study logically defined graph classes, inspired by classical model theory (stability theory).