Open Topics

We have a lot of theses available for students. You typically should have a large interest in algorithms and data structures, excellent programming skills in C++, know how to use Linux/Unix  and most importantly the ability to think for yourself.

Please send an email to Christian Schulz (christian.schulz(at) if you want to do your thesis with us.

Currently open topics include:

  • Graph compression
  • Linear-time graph drawing
  • Speedup techniques for irregular sparse All-To-All or other collective operations
  • Dynamic matching algorithms
  • Dynamic all-pair electrical flows in practice
  • Local search for the weighted independent set problem
  • Multi-Constraint graph partitioning
  • ZIP trees, skip-lists and treaps
  • Max-flow min-cut algorithms in the context of retina research