Universitätssiegel Lehrstuhllogo Deutsche Seite

University of Cologne

Institute of Computer Science

Group Prof. Dr. Henning Meyerhenke

We have moved to Berlin. Please visit our new homepage.

Our Research

General Overview

Our research group works at the interface of algorithmics, parallel/distributed computing, and applications in networked systems. We often follow the methodology of Algorithm Engineering. This means to iterate the design, analysis, implementation, and systematic experimental evaluation of algorithms. Our focus is on algorithms that are suitable for large problems and that make use of the computational power of parallel systems. Three application areas are of main interest, algorithmic network analysis, combinatorial scientific computing, and applied combinatorial optimization. They are described in more detail below.

Research Links

Algorithmic Network Analysis

This area provides algorithms for investigating complex networks from a statistical and structural point of view. It is currently funded by DFG SPP Algorithms for Big Data. Complex networks are used in many scientific areas as modelling tool. Our algorithms are collected in our toolkit NetworKit and can, for example and among many others, identify important nodes, generate synthetic networks, or compute natural groups (clusters).

Selected publications:

Combinatorial Scientific Computing

This area develops theoretical foundations, combinatorial algorithms and tools that contribute to the improvement of parallel scientific computing methods. Our works focus on load balancing of parallel graph and matrix algorithms -- which are for example used in parallel numerical simulations.

Selected publications:

Applied Combinatorial Optimization

This area addresses provably difficult problems that are often motivated by applications in the (natural) sciences. Our aim is to solve larger problem instances in a shorter time span, in particular by devising more efficient algorithms and by employing parallel computation. Besides being interesting from an algorithmic point of view, new solution techniques shall facilitate significant advancements in the application domains. Recent examples of our topics include the assembly of DNA sequences and protein structure determination -- both lead to NP-hard graph problems.

Selected publications: