Martin Luther University Halle-Wittenberg


Datenstrukturen und effiziente Algorithmen
Institut für Informatik

phone: 0345-55 24754 (Sekretariat)
fax: 0345-55 27039 (Sekretariat)

Von-Seckendorff-Platz 1
06120 Halle

Further settings

Login for editors


Our working group does research on the following topics. Further information on current projects and third-party funding can be found on our page projects.

General research areas

  • Algorithm Engineering
  • Graph algorithms
    • Shortest path problems
    • Network flows
    • Matching, b-Matching
    • Dynamic graph problems
  • Combinatorial optimization
    • Steiner trees
  • Approximation algorithms
  • Randomized algorithms
  • Parametrized complexity
  • Computational Geometry
  • Multi-criteria optimization
  • Parallel algorithms
  • Maschine Learning and AI

Research Applications

  • Timetable information (realtime, multi-criteria, robust) in public transport
  • Delay management and train disposition
  • Motifs in complex networks and their dynamical function
  • Network analysis of dynamically changing networks
  • Steiner trees and related network design problems
    • VLSI-Design
    • energy efficient ad hoc networks
  • Applications in Bioinformatics
  • Mesh generation and refinement
    • quadrilateral mesh generation
    • hexahedral mesh generation
    • Applications in biomechanics