A Typical Route

Most of our courses require other courses as prerequisites. The optimal way to obtain the necessary background knowledge is by attending our basic courses in the order depicted in the following figure.

Course List

Courses that are constantly taught are:

  1. Diskrete Strukturen (Bachelor, 2nd Semester)
  2. Einführung in die Optimierung (Bachelor, 4th Semester)
  3. Discrete Optimization (Bachelor/Master)
  4. Combinatorial Optimization (Master)
  5. Case Studies Discrete Optimization (Master)

Furthermore, we regularly offer Master courses on specialized topics such as:

  • Approximation Algorithms
  • Complexity Theory
  • Computational Convexity
  • Polyhedral Combinatorics
  • Scheduling
  • Special Topics in Algorithmic Game Theory