Main focus

Research interests are in algorithmic graph theory and network flow optimization. Our research is often characterized by a high level of practical relevance with applications in transportation planning, logistics, and optimization of infrastructure networks. Main areas of focus are:

  • network flow optimization under constraints, for example, length-constrained flows, k-splitable flows, and confluent flows
  • dynamic network flows with application to traffic signal optimization
  • investigation and minimization of circular bases of graphs, for example to accelerate the generation of interval timetables in public transport systems
  • investigation, characterization and algorithms for special graph classes like AT-free graphs and interval graphs