• A broader knowledge in the area of algorithms and data structures, in particular on graph algorithms and methods for problem solving, as well as techniques for analyzing algorithms.
• Extended ability to design proper algorithms and data structures also for challenging computational problems and to analyze and compare different algorithms.
• Extended ability to adapt existing or invent new methods for computational problem solving.

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

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.

Organization

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

Blackboard Exercises

They will take place on October 19,  November 9, November 16, November 23, December 7, and December 14 on each day in six 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.

Final Exam

The final written exam takes place on January 15, 2018 and as an additional opportunity on March 15, 2018.
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.

Grading

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%);  it is sufficient to complete 75% of all exercises for maximum points,
• 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: [88%,100%]
U2: [75%,88%)
B3: [63%,75%)
G4: [50%,63%)
N5: [0%,50%)

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.

• to obtain full points for one exercise sheet it is sufficient to complete 6 exercises
• to obtain full points for the blackboard exercises it is sufficient to complete 5 out of the 6 exercise sheets

Slides and relevant articles will be made available for download.

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