Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Structural Decompositions and Algorithms (186.856)

Course Topic

Decomposition based approaches to tackle computationally hard problems are an integral part in almost all areas of computer science and come with a wide variety of algorithmic applications. The main idea behind decomposition based techniques is to decompose a problem instance into small tractable parts, and to reassemble the solution of the parts to a solution of the entire instance. The course will provide an in-depth coverage of all aspects of the possibly two most important graph decompositions, namely tree-decompositions and clique-decompositions, with a focus on the techniques required for the design of efficient decomposition based algorithms.

Prerequisites

This course assumes prior knowledge from the following courses:
Algorithmen und Datenstrukturen 1
Algorithmen und Datenstrukturen 2
Algorithmics

Lecturers

Prof. Stefan Szeider and Dr. Sebastian Ordyniak

 

News

  • Informatics Awards 2023

    Informatics Awards 2023

    2023-12-06
    The Algorithms and Complexity group was very successful at the Informatics Awards 2023: André Schiedler won the Best Dissertation Award …Read More »
  • Jiehua Chen: promotion to tenured Associate Professor

    Jiehua Chen: promotion to tenured Associate Professor

    2023-10-18
    After her successful tenure evaluation, our colleague Jiehua Chen has been promoted to an Associate Professor. Hua joined the Algorithms …Read More »
  • Successful Graph Drawing conference 2023 in Palermo

    Successful Graph Drawing conference 2023 in Palermo

    2023-09-23
    The 31st edition of the International Symposium on Graph Drawing and Network Visualization in Palermo, Italy, ended on September 22, …Read More »
  • PhD completed by Anaïs Villedieu

    PhD completed by Anaïs Villedieu

    2023-07-24
    Anaïs Villedieu successfully defended her PhD thesis “Engineering Human-in-the-loop Graph Drawing Algorithms” on July 24, 2023. Congratulations, Dr. Villedieu! Anaïs …Read More »
  • PhD completed by Andre Schidler

    PhD completed by Andre Schidler

    2023-05-31
    Congratulations to André Schidler, who successfully defended his PhD thesis "Scalability for SAT-based combinatorial problem solving" today.   Thanks to …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021 and 2022.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.