(You are welcome to join the first meeting even if you are not yet registered and only want to learn more about the course)
Each group of students will receive a topic among a list of possible algorithmic problems with relevance for fine-grained and parameterized complexity (usually from the fields of graph theory, computational geometry or string problems). In some cases, the proposed topic is the subject of an ongoing algorithmic contest (e.g., the PACE challenge), providing an opportunity of participation as part of the course.
Under supervision, each group will:
The course aims to investigate the connections between worst-case upper & conditional lower bounds and fast practical implementations.
6 CP correspond to ~ 180 h, distributed roughly as follows:
Students should be able to apply knowledge in the specializations “Algorithmtechnik” and “Theoretische Grundlagen” to derive fast algorithms and their implementations for a given algorithmic problem. This includes:
as well as identification of reasonable relaxations
proposed for a given problem
investigating its applicability on a given problem
reductions or from real-world data sources)
Furthermore, the students can constructively engage in a team setting and are able to clearly communicate their ideas and results.
The assessment is carried out as an examination of another type (§ 4 Abs. 2 No. 3 SPO). The overall impression is evaluated. The following partial aspects are included in the grading: Project report and presentation. Students may redraw from the examination during the first two weeks after the topic has been communicated. The assessment can be repeated once.