Parameterized AlgorithmicsModule description #40627 / Version 5
- 6 CP
- Oral exam
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v8)
| Module / Version | #40627 / #5 |
|---|---|
| Validity | SS 2017 – Winter semester 2021/22 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
On successful completion, students will be able to:
- apply the approach of parameterized complexity analysis to solve computationally hard (NP-hard) problems
- design and analyze parameterized algorithms
- identify practically relevant and tractable special cases of problems that are computationally hard in general
- use complexity-theoretic methods to determine the limits of parameterized algorithmics
- apply the approach of parameterized complexity analysis to solve computationally hard (NP-hard) problems
- design and analyze parameterized algorithms
- identify practically relevant and tractable special cases of problems that are computationally hard in general
- use complexity-theoretic methods to determine the limits of parameterized algorithmics
Content
Particular topics include:
- algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size or special structures in the input
- NP-hard computational problems on graphs and networks and on strings
- algorithmic techniques such as preprocessing by data reduction, depth-bounded search trees, color coding, iterative compression, tree decomposition of graphs, parameterized reductions
- algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size or special structures in the input
- NP-hard computational problems on graphs and networks and on strings
- algorithmic techniques such as preprocessing by data reduction, depth-bounded search trees, color coding, iterative compression, tree decomposition of graphs, parameterized reductions
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Parameterized Algorithmics | Integrated course | 0434 L 220 | Irregular | [en] | 4 | ISIS |
Workload and credit points
Parameterized Algorithmics (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 4 h | 60 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 150 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Prüfungsvorbereitung | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The course material is presented in lectures. The lectures are accompanied by tutorials in which distributed work sheets are solved together.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic knowledge on algorithms
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Type of portfolio examination | 100 points in total |
| Language | English |
| Duration/Extent | 30 min |
Exam description
Final oral exam determining the grade (MP).
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Please register at QISPOS or directly at the examination office.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Slides will be made available during the lecture period: http://www.isis.tu-berlin.de/
Recommended literature
- Jörg Flum, Martin Grohe: Parameterized Complexity Theory. Springer, Berlin 2006.
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: Parameterized Algortithms. Springer International Publishing, Cham 2015
- Rod G. Downey, Michael R. Fellows: Fundamentals of Parameterized Complexity. Springer, New York 2013.
- Rolf Niedermeier: Invitation to Fixed - Parameter Algorithms. Oxford Univ. Press, Oxford 2006.
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2015 | SS 2020 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering |
| WS 2020/21 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering | |
| SS 2021 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering | |
| WS 2021/22 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering | |
| SS 2022 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering |
Miscellaneous
This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/