Newly established theoretical computer science group in Heidelberg in March 2020.

webadmin   15.10.2020

Seminar Algorithms for computationally hard problems

Instructors: Felix Joos and Robert Hancock
Place: TBA
LSF, Moodle

Please sign up to this seminar in moodle. The seminar is unfortunately only listed as a computer science seminar (and it is impossible to list the course for two subjects in moodle).

Many combinatorial problems are known to be hard to solve algorithmically. Nevertheless, we want to solve these problems but have to cut down our expectations. This seminar discusses ways how to find satisfying solutions in various aspects.

A more detail list of topics will be made available in the beginning of October.

Target group

The seminar is aimed to bachelor and master students in  mathematics, computer science and scientific computing. Knowledge in complexity theory is required or has to be learned ahead of the seminar.


The seminar will consist of twelve sessions. In each meeting a participant will give a presentation on a topic of one's choice. The first session will be an introduction to the general subject. Grades will be based on the quality of presentation and active participation.

If you would like to attend the seminar, please write an email to Felix Joos, lastname(at)