How can we deal with massive data sets which are too large to even read them? How can we analyze DNA sequences? How can we efficiently measure distances? How can we design unbreakable codes? How can we design even faster computer chips? Those are among the most fundamental questions of algorithmics. The main goal of algorithmics is to advance our knowledge on what can be done efficiently by means of computers. This involves foundational research, as well as various research applications driven by the latest technical developments. In order to be able to do that, one needs to understand the inherent structure of the problems, and to discover appropriate methods and paradigms to solve them. Sometimes, this process resembles Sherlock-Holmes-like puzzle solving, and offers some profound challenges and intellectual pleasures.
Staffed with, at present, eleven professorships, the algorithms group at the University of Bonn is one of the largest in Europe. Please click on the following links to find out more about the active research in our field.
- Discrete Algorithms (Prof. Norbert Blum)
- Multimedia Signal Processing (Prof. Michael Clausen)
- Cryptography and Computer Security (Prof. Joachim von zur Gathen)
- Discrete Mathematics (Prof. Stefan Hougardy)
- Efficient Algorithms, Combinatorial Optimization and Complexity (Prof. Marek Karpinski)
- Computational Geometry (Prof. Rolf Klein)
- Combinatorial Optimization and Chip Design (Prof. Bernhard Korte, Prof. Jens Vygen)
- Discrete Optimization (Dr. Tim Nieberg)
- Algorithms and Complexity (Jun.Prof. Nitin Saxena)
- Theoretical Computer Science (Prof. Heiko Röglin)
- Parameterized Complexity (Prof. Stefan Kratsch)