Program Overview

Institute of Theoretical Computer Science

The Institute of Theoretical Computer Science is a leading research institution that focuses on the theoretical foundations of computer science. The institute offers a range of courses and research opportunities in areas such as algorithms, complexity theory, and formal methods.

Teaching

The institute offers a variety of courses in theoretical computer science, including:

• Algorithmen und Datenstrukturen (Algorithms and Data Structures)
• Introduction to Bioinformatics
• Foundations of Theoretical Computer Science and Formal Foundations of Computer Science
• Abschlussarbeiten (Thesis)
• Absolventenseminar (Graduate Seminar)
• Archiv (Archive)

The archive section contains a list of past courses, including:

• Veranstaltungen im SS 2025 (Courses in Summer Semester 2025)
• Veranstaltungen im SS 2024 (Courses in Summer Semester 2024)
• Veranstaltungen im WS 2024/2025 (Courses in Winter Semester 2024/2025)
• Veranstaltungen im WS 2023/24 (Courses in Winter Semester 2023/2024)
• Veranstaltungen im SS 2023 (Courses in Summer Semester 2023)
• Veranstaltungen im WS 2022/2023 (Courses in Winter Semester 2022/2023)
• Veranstaltungen im SS 2022 (Courses in Summer Semester 2022)
• Veranstaltungen im SS 2021 (Courses in Summer Semester 2021)
• WS 2020/2021 (Winter Semester 2020/2021)
• WS 2020/2021 (Winter Semester 2020/2021)
• SS 2020 (Summer Semester 2020)
• WS 2019/2020 (Winter Semester 2019/2020)
• SS 2019 (Summer Semester 2019)
• WS 2018/2019 (Winter Semester 2018/2019)
• SS 2018 (Summer Semester 2018)
• WS 2017/2018 (Winter Semester 2017/2018)
• SS 2017 (Summer Semester 2017)
• WS 2016/2017 (Winter Semester 2016/2017)
• SS 2016 (Summer Semester 2016)
• WS 2015/2016 (Winter Semester 2015/2016)
• SS 2015 (Summer Semester 2015)
• WS 2014/2015 (Winter Semester 2014/2015)
• SS 2014 (Summer Semester 2014)
• WS 2013/2014 (Winter Semester 2013/2014)
• SS 2013 (Summer Semester 2013)
• WS 2012/2013 (Winter Semester 2012/2013)
• SS 2012 (Summer Semester 2012)
• WS 2011/2012 (Winter Semester 2011/2012)
• SS 2011 (Summer Semester 2011)
• WS 2010/2011 (Winter Semester 2010/2011)
• SoSe 2010 (Summer Semester 2010)
• WS 2009/2010 (Winter Semester 2009/2010)
• SoSe 2009 (Summer Semester 2009)
• WS 2008/2009 (Winter Semester 2008/2009)
• SoSe 2008 (Summer Semester 2008)
• WS 2007/2008 (Winter Semester 2007/2008)

Members

The institute has a team of experienced researchers and professors, including:

• Prof. Dr. Jacobo Torßn
• Prof. Dr. Enno Ohlebusch
• Prof. Dr. Uwe Sch÷ning
• Christiane Halder-Schnell
• M.Sc. Lisa-Marie Jaser
• Jannik Olbrich
• Ehemalige Mitarbeiter / Doktoranden (Former Employees / Doctoral Students)

Research

The institute's research areas include:

• EDACC
• Sequence Analysis
• SAT Solving
• Dichte Packung von Garnrollen auf Paletten (Dense Packing of Yarn Rolls on Pallets)

Course: Algorithmen f³r schwierige Probleme (Algorithms for Hard Problems)

Inhalt (Content)

This course covers algorithms for solving hard problems, including:

• Approximative Algorithmen (Approximate Algorithms)
• Algorithmen mit moderater exponentieller Komplexitõt (Algorithms with Moderate Exponential Complexity)
• Parametrisierte Algorithmen (Parameterized Algorithms)

The course consists of lectures and integrated exercises, and requires knowledge of basic algorithms and complexity theory.

Materialien (Materials)

• Vorlesungsskript (Lecture Script)
• Literatur (Literature):
  • R. Downey, M. Fellows: Parameterized Complexity, Springer-Verlag, 1999.
  • F. Fomin and D. Kratsch: Exact Exponential Algorithms, Springer, 2010
  • R. Motwani, P. Raghavan: Randomized Algorithms. Cambridge University Press, 1995.
  • R. Niedermeier: Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2006
  • U. Sch÷ning: Algorithmik. Spektrum Akademischer Verlag, 2001.
  • C.H. Papadimitriou: Computational Complexity. Addison-Wesley, 1994.

Dozenten (Lecturers)

• Prof. Dr. Jacobo Torßn

Vorlesungszeiten (Lecture Times)

• Di 10-12, Raum O27 - 2201
• Do 10-12, Raum O27 - 122