Kurs: SS26: Visualization of Graphs

Abschnittsübersicht

General Information

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

Peter Eades, Giuseppe Di Battista, Roberto Tamassia, Ionnis Tollis: "Graph Drawing: Algorithms for the Visualization of Graphs", Pearson 1999. (Available in the University Library)
Roberto Tamassia (editor): "Handbook of Graph Drawing and Visualization", Taylor & Francis 2014. (Available in the University Library)

Aktivität Announcements auswählen

Announcements Forum
Aktivität Discussion auswählen

Discussion Forum

Nicht verfügbar, außer: Ihr Profilfeld E-Mail-Adresse ist nicht leer

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]

Abschnitt Tutorials auswählen

Einklappen Ausklappen
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.
- Aktivität Latex Template auswählen
  
  Latex Template Datei
- Aktivität Exercise 01 auswählen
  
  Exercise 01 Aufgabe
  
  Öffnet: Samstag, 25. April 2026, 10:00
  
  Fällig: Samstag, 2. Mai 2026, 10:15
- Aktivität Exercise 02 auswählen
  
  Exercise 02 Aufgabe
  
  Öffnet: Samstag, 2. Mai 2026, 10:15
  
  Fällig: Samstag, 9. Mai 2026, 10:15
- Aktivität Exercise 03 auswählen
  
  Exercise 03 Aufgabe
  
  Öffnet: Samstag, 16. Mai 2026, 10:15
  
  Fällig: Samstag, 23. Mai 2026, 10:15
- Aktivität Exercise 04 auswählen
  
  Exercise 04 Aufgabe
  
  Öffnet: Samstag, 23. Mai 2026, 10:15
  
  Fällig: Dienstag, 2. Juni 2026, 10:15
- Aktivität Exercise 05 auswählen
  
  Exercise 05 Aufgabe
  
  Öffnet: Samstag, 30. Mai 2026, 10:15
  
  Fällig: Samstag, 6. Juni 2026, 10:15
  
  Verfügbar ab 30. Mai 2026, 10:15
- Aktivität Exercise 06 auswählen
  
  Exercise 06 Aufgabe
  
  Öffnet: Samstag, 6. Juni 2026, 10:15
  
  Fällig: Samstag, 13. Juni 2026, 10:15
  
  Verfügbar ab 6. Juni 2026, 10:15
- Aktivität Exercise 07 auswählen
  
  Exercise 07 Aufgabe
  
  Öffnet: Samstag, 13. Juni 2026, 10:15
  
  Fällig: Samstag, 20. Juni 2026, 10:15
  
  Verfügbar ab 13. Juni 2026, 10:15
- Aktivität Exercise 08 auswählen
  
  Exercise 08 Aufgabe
  
  Öffnet: Samstag, 20. Juni 2026, 10:15
  
  Fällig: Samstag, 4. Juli 2026, 10:15
  
  Verfügbar ab 20. Juni 2026, 10:15
- Aktivität Exercise 09 auswählen
  
  Exercise 09 Aufgabe
  
  Öffnet: Samstag, 4. Juli 2026, 10:15
  
  Fällig: Samstag, 11. Juli 2026, 10:15
  
  Verfügbar ab 4. Juli 2026, 10:15
- Aktivität Exercise 10 auswählen
  
  Exercise 10 Aufgabe
  
  Öffnet: Samstag, 11. Juli 2026, 10:15
  
  Fällig: Samstag, 18. Juli 2026, 10:15
  
  Verfügbar ab 11. Juli 2026, 10:15
- Aktivität Exercise 11 auswählen
  
  Exercise 11 Aufgabe
  
  Öffnet: Samstag, 18. Juli 2026, 10:15
  
  Fällig: Samstag, 25. Juli 2026, 10:15
  
  Verfügbar ab 18. Juli 2026, 10:15
- Aktivität Exercise 12 auswählen
  
  Exercise 12 Aufgabe
  
  Öffnet: Samstag, 18. Juli 2026, 10:15
  
  Fällig: Samstag, 25. Juli 2026, 10:15
  
  Verfügbar ab 25. Juli 2026, 10:15