Algorithmics

We are interested in the design and analysis of efficient algorithms for a wide range
of computational problems, mostly for hard decision and optimization problems in graphs or strings.

Our research addresses fundamental questions such as running time lower bounds for solving hard problems and
more applied ones such as algorithm engineering for concrete computational problems.

Research interests:

• Computational complexity
• Parameterized algorithms
• Algorithm Engineering
• Graph algorithms / Network algorithms
• Computational biology