186.814 Algorithmics
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2020W, VU, 4.0h, 6.0EC


  • Semester hours: 4.0
  • Credits: 6.0
  • Type: VU Lecture and Exercise
  • Format: Online

Learning outcomes

After successful completion of the course, students are able to use advanced techniques to design efficient algorithms for the solution of computational problems. Furthermore, the students can justify the correctness of their algorithmic solutions and can determine their efficiency by theoretical methods.

Subject of course

This module covers advanced algorithms and data structures and algorithm analysis. It has an emphasis on (but is not limited to) algorithms on graphs and methods for problem solving and optimization. The module consists of a lecture together with exercises.

Topics covered:

  • Network flows and matchings
  • Planarity of graphs
  • A* algorithm
  • Randomized algorithms
  • Linear and (mixed) integer linear programming
  • Parameterized algorithms and kernelization
  • Graph decompositions and treewidth
  • Geometric Algorithms

Teaching methods

Introduction and explanation of general methods, discussion of examples, justification by giving formal arguments and proofs, independent problem solving, presentation and discussion of solutions.

Mode of examination


Additional information


The course is divided by topics into six blocks, each consisting of three lectures and one exercise.
The final grade will be based on the exercises and on the final exam. There are six mandatory units of exercises.

Due to Covid-19, all lectures will either take place via live Zoom video meetings (where you also have the possibility to ask questions via chat) and/or provided as video streams.

The first live session takes place on October 5, 15:15-16:45, and is accessible via https://tuwien.zoom.us/j/96348044126. After a brief presentation of the course organization, the first lecture will be given. 


They will take place on Thursday 22.10., 29.10., 19.11., 26.11., 10.12., and 17.12., each day in several groups at different times.
You will receive instructions a few weeks before these units and are expected to submit your solutions in advance and also to be able to present your solutions at the blackboard.
You have to register to one of the six groups in TISS and attendance to the exercise lessons of your particular group is compulsory.
Exercise sheets will be available for download.

The exercises take place via Zoom video meetings. It is your responsibility to have a stable internet connection and the necessary hardware (PC/laptop with webcam) available to participate. Video must always be switched on during the exercises.

Final Exam

The final written exam takes place via Zoom on February 2, 2021 and as an additional opportunity on March 15, 2021.
At least one exam has to be taken, if both are done then only the best result counts, and only one certificate will be issued.


The mark you receive depends on this final exam (40%) and your performance at the blackboard exercises (60%).
Blackboard exercises will influence your grade via two different measures:

  • the total number of exercises you indicate to have accomplished and submitted before the deadlines (40%),
  • your presentations of exercises at the blackboard (20%);

The minimal requirements for a positive grade are:

  • >=37% of all blackboard examples marked and successfully submitted in TUWEL (both) before the deadlines as well as at least 3 exercises per exercise sheet from at least 5 of the 6 exercise blocks
  • >=50% on average on your blackboard presentations
  • >=40% on at least one of the two written exams

To obtain full points for the exercises it is sufficient to mark and submit >=75% of all blackboards examples.

Overall grade distribution:

S1: [83%,100%]
U2: [71%,83%)
B3: [58%,71%)
G4: [45%,58%)
N5: [0%,45%)

Note: Once you attended at or submitted your solutions for at least one blackboard exercise session you will in any case receive a grade at the end of the term.

Course material

The lecture slides will be available in TUWEL.

Estimated effort

Hours   Activity
       32   Lecture
       65   Preparation of exercises
         6   Exercise groups
       45   Exam preparation
         2   Written exam
     150   Overall 

Please send general and organisational questions to algorithmics@ac.tuwien.ac.at.



Course dates

Mon15:00 - 17:0005.10.2020 - 14.12.2020 Zoom (LIVE)Lecture
Wed09:00 - 11:0007.10.2020 - 16.12.2020 Lecture
Thu09:30 - 16:3022.10.2020 - 17.12.2020 via Zoom (LIVE)Exercise Groups 1-6 (refer to the groups for exact times)
Mon15:00 - 16:0025.01.2021 (LIVE)Algorithmics Question Time
Algorithmics - Single appointments
Mon05.10.202015:00 - 17:00 ZoomLecture
Wed07.10.202009:00 - 11:00 Lecture
Mon12.10.202015:00 - 17:00 ZoomLecture
Wed14.10.202009:00 - 11:00 Lecture
Mon19.10.202015:00 - 17:00 ZoomLecture
Wed21.10.202009:00 - 11:00 Lecture
Thu22.10.202009:30 - 16:30 via ZoomExercise Groups 1-6 (refer to the groups for exact times)
Wed28.10.202009:00 - 11:00 Lecture
Thu29.10.202009:30 - 16:30 via ZoomExercise Groups 1-6 (refer to the groups for exact times)
Wed04.11.202009:00 - 11:00 Lecture
Mon09.11.202015:00 - 17:00 ZoomLecture
Wed11.11.202009:00 - 11:00 Lecture
Mon16.11.202015:00 - 17:00 ZoomLecture
Wed18.11.202009:00 - 11:00 Lecture
Thu19.11.202009:30 - 16:30 via ZoomExercise Groups 1-6 (refer to the groups for exact times)
Mon23.11.202015:00 - 17:00 ZoomLecture
Wed25.11.202009:00 - 11:00 Lecture
Thu26.11.202009:30 - 16:30 via ZoomExercise Groups 1-6 (refer to the groups for exact times)
Mon30.11.202015:00 - 17:00 ZoomLecture
Wed02.12.202009:00 - 11:00 Lecture

Examination modalities

Submission of solutions of examples, presentation of independent solutions in exercise classes, solving exam questions in written tests.


DayTimeDateRoomMode of examinationApplication timeApplication modeExam
Fri16:00 - 19:0021.03.2025GM 1 Audi. Max.- ARCH-INF written05.01.2025 00:00 - 19.03.2025 23:59TISSNachtragstest

Group dates

Exercise Group 1Thu10:00 - 11:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 1
Exercise Group 2Thu11:00 - 12:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 2
Exercise Group 3Thu12:00 - 13:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 3
Exercise Group 4Thu14:00 - 15:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 4
Exercise Group 5Thu15:00 - 16:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 5
Exercise Group 6Thu16:00 - 17:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 6
Exercise Group 7Thu17:00 - 18:0022.10.2020 - 17.12.2020 Institutsbibliothek HB 0408 (Favoritenstraße)186.814 Algorithmics Exercise Group 7

Course registration

Begin End Deregistration end
22.09.2020 00:00 12.10.2020 23:59

Group Registration

GroupRegistration FromTo
Exercise Group 113.10.2020 09:0018.10.2020 23:59
Exercise Group 213.10.2020 09:0018.10.2020 23:59
Exercise Group 313.10.2020 09:0018.10.2020 23:59
Exercise Group 413.10.2020 09:0018.10.2020 23:59
Exercise Group 513.10.2020 09:0018.10.2020 23:59
Exercise Group 613.10.2020 09:0018.10.2020 23:59
Exercise Group 713.10.2020 09:0018.10.2020 23:59


Study CodeObligationSemesterPrecon.Info
066 645 Data Science Not specified
066 646 Computational Science and Engineering Not specified
066 926 Business Informatics Mandatory elective
066 931 Logic and Computation Mandatory1. Semester
066 932 Visual Computing Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 938 Computer Engineering Mandatory elective
860 GW Optional Courses - Technical Mathematics Not specified


Slides and relevant articles will be made available for download.

Previous knowledge

A good understanding of basic algorithms and data structures and methods to analyze them.

Preceding courses

Continuative courses