Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Parameterized AlgorithmicsModule description #40627 / Version 3

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v8)
Module / Version#40627 / #3
ValidityWS 2015/16 – WS 2015/16
Available language(s)English
Credit points6
Person responsible for the moduleNiedermeier, Rolf
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://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

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

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Parameterized AlgorithmicsIntegrated course Winter and summer semester–4 ISIS

Workload and credit points

Parameterized Algorithmics (Integrated course)

Workload descriptionMultiplierHoursTotal
Präsenzzeit154 h60 h
Vor-/Nachbereitung158 h120 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

GradingGraded
Exam formatOral exam
LanguageEnglish

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 Flum, Martin Grohe: Parameterized Complexity Theory. Springer, Berlin 2006.
  • 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 is not used in any program.

Computer Science diploma
Technical Computer Science diploma

Miscellaneous

Not specified