• Independent research of a specific scientific topic from the field of algorithms and data structures, especially optimization.
• 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
• Interior Point Method
• Robust Discrete Optimization
• Stochastic Integer Programming
• No Free Lunch Theorems

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

ECTS-Breakdown

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

Course schedule

1. topic selection
2. hand-in of a preliminary literature list
3. presentation
4. hand-in of the final version of the term paper

Exact dates will be anounced in the preliminary meeting and in the TUWEL course.
This course will be administered in TUWEL!

Please ask general and organisational questions at 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 18.03.2019 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