186.182 Seminar on Algorithms
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2022W, SE, 2.0h, 3.0EC
TUWELQuinn ECTS survey


  • Semester hours: 2.0
  • Credits: 3.0
  • Type: SE Seminar
  • Format: Online

Learning outcomes

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

Subject of course

Selection of possible topics:

  • Algorithms for Boolean Synthesis
  • Proof Complexity of Quantified Boolean Formulas
  • Courcelle's Theorem for Treewidth and Clique-width
  • Parameterized Algorithms and Notable Parameters for the Constraint Satisfaction Problem
  • Algorithmic Lower Bounds Based on the Exponential Time Hypothesis
  • Parameterized Complexity of Scheduling Problems
  • Logic-based Benders decomposition
  • Monte-Carlo Tree Search for Combinatorial Optimization Problems
  • ...

Teaching methods

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.

Mode of examination

Written and oral

Additional information


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

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 choice of a topic in TUWEL by 23.10.2022 is mandatory.  Students who fail to do so will be deregistered, allowing someone from the waiting list to take their place.

Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)



Course dates

Fri09:00 - 13:0002.12.2022 - 16.12.2022Seminarraum FAV 01 C (Seminarraum 188/2) Presentations
Seminar on Algorithms - Single appointments
Fri02.12.202209:00 - 13:00Seminarraum FAV 01 C (Seminarraum 188/2) Presentations
Fri16.12.202209:00 - 13:00Seminarraum FAV 01 C (Seminarraum 188/2) Presentations

Examination modalities

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

Course registration

Begin End Deregistration end
06.10.2022 12:00 17.10.2022 23:55 05.11.2022 22:55


Study CodeObligationSemesterPrecon.Info
066 931 Logic and Computation Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
860 GW Optional Courses - Technical Mathematics Not specified


No lecture notes are available.

Preceding courses

Accompanying courses


  • Attendance Required!