Avsnittsöversikt

  • General Information

    Fäll ihop allt Expandera allt
    This course covers the most important algorithms to draw graphs. Methods from the course Algorithmische Graphentheorie (Algorithmic Graph Theory) such as divide and conquer, flow networks and integer programming will be used. We will become familiar with measures of quality of a graph drawing as well as algorithms that optimize these measures.
     
    Our goal is to get an overview of graph visualization and familiarize with common tools in order to consolidate our knowledge about the modeling and solving of problems with the help of graphs and graph algorithms.
     
    The language of this course will be English (except if all participants understand German).
     
    Lectures: Fridays, 10:15–11:45 in Seminarraum II, Computer Science Building (M2), starting on April 17. The last lecture (on July 17) will take place in M4.00.012 due to the EXPO.
    Tutorials: Wednesdays, 16:00–17:30 in Seminarraum II, Computer Science Building (M2), starting on April 22.
    Lecturers: Alexander Wolff (lectures) and Adrian Samoticha (tutorials)
    Assessment: Oral examination (one candidate each, approx. 20 minutes) in the end of July.
    If you achieve at least 50% of the points on the exercise sheets, you receive a 0.3 grade bonus on the final grade (provided that you pass the oral exam).
    Extend: 5 ECTS, 2+2 SWS
    Prerequisites: Highly recommended: Algorithmische Graphentheorie (Algorithmic Graph Theory)
    Target Audience: Master Computer Science, Master Mathematics, Master Computational Mathematics, etc.
    Videos: Old videos (from 2021 in German) by Jonathan Klawitter will be made available. English videos by Philipp Kindermann are available here: https://www.youtube.com/playlist?list=PLubYOWSl9mIvoXDwf_Wqcrvlg15N_AWQE

    Registration
    Please enroll into this WueCampus course room: use the rightmost item in the bar below the course title: "Mich in diesem Kurs einschreiben".
    You also need to register in WueStudy (except if you are an Erasmus student); the registration is open from April 16 until July 15. If you do not register, you cannot take the oral exam.

    Literature
     
    • Announcements Forum
    • Discussion Forum
      Tillgänglig om: Fältet E-postadress är inte tomt

  • Lectures

    We provide the slides and further literature for each lecture. Additionally, for some (parts of the) lectures, there are videos from 2021 and 2020 (here).

    Date (+ long) Topic (+ short slides) Old videos (German) Exercise sheet Literature  
    17.04.2026
    17.04.2026    		 Introduction to Graph Visualization
    Drawing Trees via Divide & Conquer    		 Introduction
    Layered · HV · Radial    		 [1] [GD Ch 3.1 & 3.2]  

  • Tutorials

    There will be a new exercise sheet every week after the lecture (except for the last two lectures). The deadline for each is the next lecture. Your submission will be graded, and if you achieve at least 50% of points in total, you receive a 0.3 grade bonus on the final grade (provided you pass the exam). We ask you to form groups of two and submit one solution per group. Please state the names of both group members on your submission. Please submit your solution digitally. You may use the provided LaTeX template. We accept submissions in German and English. Do not use AI. It does not make sense that we spend time grading AI-produced solutions to give you feedback.

    • Latex Template Fil
    • Exercise 01 Inlämningsuppgift
      Öppnar: lördag, 25 april 2026, 10:00
      Senaste inlämningsdatum: lördag, 2 maj 2026, 10:15
    • Exercise 02 Inlämningsuppgift
      Öppnar: lördag, 2 maj 2026, 10:15
      Senaste inlämningsdatum: lördag, 9 maj 2026, 10:15
    • Exercise 03 Inlämningsuppgift
      Öppnar: lördag, 16 maj 2026, 10:15
      Senaste inlämningsdatum: lördag, 23 maj 2026, 10:15
    • Exercise 04 Inlämningsuppgift
      Öppnar: lördag, 23 maj 2026, 10:15
      Senaste inlämningsdatum: tisdag, 2 juni 2026, 10:15
    • Exercise 05 Inlämningsuppgift
      Öppnar: lördag, 30 maj 2026, 10:15
      Senaste inlämningsdatum: lördag, 6 juni 2026, 10:15
      Tillgänglig från 30 maj 2026, 10:15
    • Exercise 06 Inlämningsuppgift
      Öppnar: lördag, 6 juni 2026, 10:15
      Senaste inlämningsdatum: lördag, 13 juni 2026, 10:15
      Tillgänglig från 6 juni 2026, 10:15
    • Exercise 07 Inlämningsuppgift
      Öppnar: lördag, 13 juni 2026, 10:15
      Senaste inlämningsdatum: lördag, 20 juni 2026, 10:15
      Tillgänglig från 13 juni 2026, 10:15
    • Exercise 08 Inlämningsuppgift
      Öppnar: lördag, 20 juni 2026, 10:15
      Senaste inlämningsdatum: lördag, 4 juli 2026, 10:15
      Tillgänglig från 20 juni 2026, 10:15
    • Exercise 09 Inlämningsuppgift
      Öppnar: lördag, 4 juli 2026, 10:15
      Senaste inlämningsdatum: lördag, 11 juli 2026, 10:15
      Tillgänglig från 4 juli 2026, 10:15
    • Exercise 10 Inlämningsuppgift
      Öppnar: lördag, 11 juli 2026, 10:15
      Senaste inlämningsdatum: lördag, 18 juli 2026, 10:15
      Tillgänglig från 11 juli 2026, 10:15
    • Exercise 11 Inlämningsuppgift
      Öppnar: lördag, 18 juli 2026, 10:15
      Senaste inlämningsdatum: lördag, 25 juli 2026, 10:15
      Tillgänglig från 18 juli 2026, 10:15
    • Exercise 12 Inlämningsuppgift
      Öppnar: lördag, 18 juli 2026, 10:15
      Senaste inlämningsdatum: lördag, 25 juli 2026, 10:15
      Tillgänglig från 25 juli 2026, 10:15