The research in the working group of Prof. Hans Jürgen Prömel links discrete mathematics with theoretical computer science.
For many problems in combinatorial optimization efficient exact algorithms are unknown or cannot exist under commonly accepted complexity theoretical assumptions. Our research activities involve the design, analysis, and implementation of algorithms which approximate optimal solutions or exploit randomness in various ways. The investigation of discrete structures, which appear in the analysis of algorithms or deserve independent mathematical interest, forms another focus of research. In the area of bioinformatics we are concerned e.g. with the application of random discrete structures in models of similarity networks.
Areas of Research
Follow the links to view abstracts.- Approximation algorithms, randomized algorithms and probabilistic analysis
- Random structures, extremal combinatorics and Ramsey theory
- Bioinformatics
- Planar Graphs
Recent Projects
- Analysis and Modelling of complex Networks (inside the DFG-Research Center Matheon)
- Research Group "Algorithms, Structure, Randomness"
- Research Training Group "Methods for Discrete Structures"
- Berlin Center for Genome Based Bioinformatics (BCB)
- Berlin-Poznan Seminar in Discrete Mathematics
Earlier Projects
- DFG-Project "Approximative, Randomized and Probabilistic Algorithms for Combinatorial Optimization Problems"
- Graduate Program "Algorithmic Discrete Mathematics"
- European Graduate Program "Combinatorics, Geometry, Computation"
- DISSY (driver scheduling in public transport)
- DFG-Project "Probabilistic Arguments and Algorithmic Problems in Graphs and Hypergraphs"
- PARALOR (Parallel Algorithms for Large Scale Operations Research Problems)
Deutsch