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

From VoWi
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Daten

Lecturers Robert Ganian
ECTS 3
Department Forschungsbereich Algorithms and Complexity
When winter semester
Links tiss:186855 , Mattermost-Channel
Zuordnungen
Master Logic and Computation Wahlmodul Algorithms and Complexity
Master Software Engineering & Internet Computing Wahlmodul Algorithmik
Master Technische Informatik Wahlmodul Algorithms and Programming

Mattermost: Channel "fixed-parameter-algorithms-and-complexity"RegisterMattermost-Infos

Inhalt

Algorithms, techniques and proofs from the area of fixed-parameter algorithms. Some of the proofs are rather hard, but the lecturer does a good job at explaining them and focuses on the big picture, instead of getting lost in details. Additionally, you do not need to understand the proofs from the lecture to pass the course (although it will probably help when preparing the presentation).

Ablauf

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.

Vortrag

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.

Übungen

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

Zeitaufwand

Definitely within 3 ECTS. Attending the 6 lectures takes approx. 6*3=18 hours. Add to that the time required to understand a paper and 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.

Unterlagen

noch offen

Tipps

  • If you enjoyed Robert Ganians part of the Algorithmics VU, then this course is definitely worth doing.

Verbesserungsvorschläge / Kritik

noch offen

Attachments

This page has no attachments yet but you can add some.