After successful completion of the course, students are able to

• read and understand current original research papers in the area of algorithmics and perform literature research for related work
• extract the key aspects and results of a research topic and organizing them for a presentation
• create presentation slides and present their research topic to their peers
• summarize the key content and results of a research topic in their own words in a scientific seminar paper
• participate actively in joint research discussions of open algorithmic problems and to document the observations and progress of the discussion

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.

Students read original papers, perform literature research for related work and discuss their results with their advisor. They create presentation slides and receive feedback. They write their seminar paper using LaTeX and learn how to use bibliography management tools. Research discussions take place in groups of several students and their advisors.

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 21.10.2019 in FAV 01 C is mandatory.  Students who do not attend the preliminary meeting will be deregistered, allowing someone from the waiting list to take their place.

• seminar presentation (40%)
• seminar paper (45%)
• minutes of a research session (15%)

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