Research Group Algorithm Engineering

We are interested in the design, theoretical analysis, and experimental evaluation of algorithms for a broad range of computational problems. Our main focus lies on NP-hard problems. In general, these problems have no efficient algorithms but many real-world instances can be usually solved quite efficiently. Typical problems considered in our research arise in different areas of data science such as

• Network analysis (graph clustering, community detection)
• Computational biology (string algorithms, phylogenetics)
• Machine learning (decision trees, Bayesian networks)