Institut für Theoretische Informatik, Algorithmik

Graph Drawing (Algorithmen zur Visualisierung von Graphen)

Winter Term 2023/24

  • Exercise Class: Laura Merker
  • Schedule: Tue, Wed, 2 PM (on average one lecture per week and one exercise class every two weeks)
  • Place: Room 301, CS Building 50.34
  • Credits: 5 ETCS
  • Exam: Oral exams
  • Language: English

Topic

Graph Drawing aims at finding a geometric representation for a given graph, usually while optimizing some criteria like area, edge length, angular resolution, etc. In this lecture, we consider several graph classes for which we learn techniques to prove the existence of different geometric representations and to develop algorithms to compute them. This touches algorithmic techniques, graph theory, and geometry.

Schedule

(subject to change)

Tuesday Wednesday
24.10.23 Lecture 1 25.10.23 Lecture 2
31.10.23 01.11.23
07.11.23 Exercise Class 08.11.23 Lecture 3
14.11.23 Introduction to OGDF and practical tasks 15.11.23
21.11.23 Lecture 4 22.11.23 Lecture 5
28.11.23 Exercise Class 29.11.23 Lecture 6
05.12.23 Lecture 7 06.12.23 Lecture 8
12.12.23 Exercise Class 13.12.23 Lecture 9
19.12.23 20.12.23
09.01.24 Lecture 10 10.01.24 Lecture 11
16.01.24 Exercise Class 17.01.24 Lecture 12
23.01.24 Lecture 13 24.01.24 Exercise Class
30.01.24 Lecture 14 31.01.24 Lecture 15
06.02.24 Exercise Class 07.02.24
13.02.24 14.02.24

Literature

  • Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis, Graph Drawing – Algorithms for the Visualization of Graphs, Prentice Hall, 1999, ISBN: 0-13-30-1615-3.
  • Michael Kaufmann, Dorothea Wagner (Eds.), Drawing Graphs – Methods and Models, Lecture Notes in Computer Science Tutorial 2025 Springer, 2001, ISBN: 978-3-540-42062-0.
  • Takao Nishizeki, Md Saidur Rahman, Planar Graph Drawing, World Scientific, 2004, ISBN: 981-256-033-5.
  • Roberto Tamassia (Ed.), Handbook of Graph Drawing and Visualization, CRC Press, 2013, ISBN: 978-1-58488-412-5.