192.064 Seminar in Theoretical Computer Science Canceled
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2019W, SE, 2.0h, 3.0EC, to be held in blocked form


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

Learning outcomes

After successful completion of the course, students are able to...

  • use formal methods from the area of parameterized complexity
  • and apply them in practice doing concrete implementations
  • apply SAT tools in practice

Subject of course

In this seminar, we discuss algorithmic graph theory and the use of its methods for the problems in the field of boolean satisfiability (SAT and QSAT). We focus on the design and implementation of parameterized algorithms in this area. In particular, the goal is to employ tree decompositions in such  a way that existing SAT-solvers can be integrated in the corresponding algorithm.


Teaching methods

Design, implementation, and presentation of a parameterized algorithm.

Mode of examination


Additional information

ECTS Breakdown:

  • 10h introduction to subject matter
  • 30h algorithm design and implementation, 
  • 25h presentation (including time to prepare)

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: https://www.tuwien.at/fileadmin/Assets/dienstleister/Datenschutz_und_Dokumentenmanagement/Plagiarism.pdf



Examination modalities

Assessement is based on the implementation and the oral presenation.

Course registration

Not necessary



No lecture notes are available.