Parameterized AlgorithmicsModule description #40627 / Version 1
- 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 / #1 |
|---|---|
| Validity | SS 2014 – WS 2014/15 |
| 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
Participants of the module
* know the approach of parameterized complexity analysis for solving NP-hard computational problems,
* are able to design and analyse parameterized algorithms, and
* can use complexity-theoretic methods to determine the limits of parameterized algorithmics.
The course is principally designed to impart:
technical skills 50%, method skills 50%, system skills 0%, social skills 0%
* know the approach of parameterized complexity analysis for solving NP-hard computational problems,
* are able to design and analyse parameterized algorithms, and
* can use complexity-theoretic methods to determine the limits of parameterized algorithmics.
The course is principally designed to impart:
technical skills 50%, method skills 50%, system skills 0%, social skills 0%
Content
Particular topics include
* algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size
* 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
* algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size
* 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
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 | Winter and summer semester | – | 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 | 8 h | 120 h |
| 180 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 an active participation and homework on the distributed work sheets is required.
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 |
| Language | English |
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 – http://www.isis.tu-berlin.de/
Recommended literature
- Jörg Fl um, Martin Grohe: Parameterized Complexity Theory . Springer, Berlin 2006.
- Rod G. Downey, Michael R. Fellows: Parameterized Complexity . Springer, New York 1999.
- Rolf Niedermeier: Invitation to Fixed - Parameter Algorithms . Oxford Univ. Press, Oxford 2006.
Assigned programs
This module is not used in any program.
Computer Science diploma
Technical Computer Science diploma
Technical Computer Science diploma
Miscellaneous
Not specified