Independent research of a specific scientific topic from the field of algorithms and data structures, especially optimization and fixed parameter complexity. The results are presented during a talk in the seminar and in a term paper.
The main aim of the seminar is mastering the chosen topic by the independent analysis of the scientific work in this field. In addition, the presentation technique in the technical-scientific field should be practiced.

Selection of possible topics:

• The Exponential Time Hypothesis
• Treewidth
• Clique-width
• Schaefer's Dichotomy theorem
• Parameterized Complexity
• Benders' Decomposition
• Robust Discrete Optimization
• No Free Lunch Theorems
• Lagrangian Relaxation/Decomposition
• ...

Of course, it is also possible to propose your own topic.

ECTS-Breakdown

   3h Choosing the topic
12h Presentations
10h Preparing for presentation
50h Researching the chosen topic
----
75h

Please send mails concerning general and organisational issues to seminar@ac.tuwien.ac.at.

The maximum number of participants is limited to 10. There is however a waiting list. The attendance of the preliminary meeting on the 15.10.2018 is mandatory.  Students who do not attend the preliminary meeting will be deregistered, allowing someone from the waiting list to take their place.

Oral presentation and term paper

The maximum number of participants is 10. For participation in the course it is mandatory to attend the preliminary meeting on 15.10.2018. There will be a waiting list.