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

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

Please also regard the additional information available on the homepage of this coure!

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.

Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: http://www.tuwien.ac.at/fileadmin/t/ukanzlei/t-ukanzlei-english/Plagiarism.pdf
Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)

Oral presentation and term paper

No lecture notes are available.