Algorithmic and Structural Graph Theory

The Algorithmic and Structural Graph Theory group, led by Daniel Neuen, studies fundamental questions at the intersection of discrete mathematics and theoretical computer science. Our research focuses on understanding the structure of graphs and related combinatorial objects and on using this structure to design efficient algorithms.

Key research areas include structural graph theory, graph symmetries and similarities, parameterized complexity, finite model theory, and algebraic methods for algorithm design, as well as their many connections. A recurring theme is the interplay between structural properties, logical descriptions, symmetry, and computational complexity. We are particularly interested in developing new algorithmic techniques and in understanding the mathematical principles that make difficult computational problems tractable.

We offer lectures, seminar, and thesis topics related to the interests of the group