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:

• Randomized Approximation Algorithms for #DNF
• Algorithms for QBF Evaluation
• First-Order Model Counting
• Impagliazzo's Five Worlds of Average-Case Complexity
• Transformers (machine learning model)
• The Exponential Time Hypothesis
• The Cutting Plane Method
• Totally unimodular Integer Linear Programs
• Latin Squares and Applications

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 + 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.

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