TU Wien:Fixed-Parameter Algorithms and Complexity VU (Ganian)

From VoWi
Revision as of 21:34, 29 January 2018 by Zogler (talk | contribs) (Die Seite wurde neu angelegt: „<!-- Das hier ist ein Template für neue Artikel. Bitte fülle die Daten-Sektion möglichst genau aus, da diese Daten dazu benutzt werden könnten, eine Face…“)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search



Algorithms, techniques and proofs from the area of fixed-parameter algorithms.


WS17: Blocked on 6 days in January. 4.5 blocks are lectures, the last block is for student presentations.

Benötigte/Empfehlenswerte Vorkenntnisse

The FPT part from Algorithmics VU is helpful but not required.


In English. Mr Ganian is a great lecturer. He not only presents the results, but usually leads the students to them. The atmosphere is very relaxed.


One 20-25 minute presentation of a selected paper from International Symposium on Parameterized and Exact Computation (IPEC). You should present the main results and at least one non-trivial proof from the paper.

Prüfung, Benotung

Doing the presentation gets you a "Befriedigend" (unless you do very badly, which didn't happen this semester). In order to get a better grade, you need to do an oral exam.

Dauer der Zeugnisausstellung

noch offen


Well within 3 ECTS. Attending the 6 lectures takes approx. 6*3=18 hours. Add to that the time required to understand a paper prepare a presentation (15 hours?), and you have certainly passed the course. To get a better grade than 3, you will have to study for the exam, but if you pay attention during the lectures this shouldn't be too much work.


noch offen


noch offen

Verbesserungsvorschläge / Kritik

noch offen