Ämne Namn Beskrivning
Themen und Vorlesungen Fil Lecture #0: Organisational matters
Sida Lecture #0: Organisational matters
Fil Lecture #1: Introduction
Fil Lecture #1: Introduction kurz
Sida Lecture video #1a: Introduction
Fil Lecture #1: Examples
Sida Lecture video #1b: Examples
Fil Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs
Fil Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs kurz
Sida Lecture video #1c: Trees, level-based layout
Sida Lecture video #1d: hv-drawings
Sida Lecture video #1e: radial layout
Sida Lecture video #1f: Series-parallel graphs
Fil Lecture #2: Planar straight-line drawings with shift method
Fil Lecture #2: Planar straight-line drawings with shift method short
Fil Lecture video #2a: Canonical order
Fil Lecture video #2b: Shift method
Fil Lecture #3: Planar straight-line drawings with Schnyder realiser
Fil Lecture #3: Planar straight-line drawings with Schnyder realiser short
Fil Lecture video #3a: Planar straight-line drawings with Schnyder realiser
Fil Lecture video #3b: Planar straight-line drawings with Schnyder realiser
Fil Lecture #4: Orthogonal layouts
Fil Lecture #4: Orthogonal layouts short
Fil Lecture video #4a: Orthogonal layouts intro
Fil Lecture video #4b: Orthogonal representations
Fil Lecture video #4c: Orthogonal drawings
Fil Lecture video #4d: Orthogonal compaction NP-hardness
Fil Lecture #5: Upward planar drawings
Fil Lecture #5: Upward planar drawings short
Fil Lecture video #5a: Upward planar drawings intro
Fil Lecture video #5b: Upward planar drawings
Fil Lecture #6: Hierarchical layouts
Fil Lecture #6: Hierarchical layouts short
Fil Lecture #7: Contact representations
Fil Lecture #7: Contact representations short
Fil Lecture #8: The Crossing Lemma
Fil Lecture #8: The Crossing Lemma short
Fil Lecture #9: Force-directed algorithms
Fil Lecture #9: Force-directed algorithms short
Fil Lecture #10: SPQR-trees and Partial Bar Visibility Representation Extension
Fil Lecture #10: SPQR-trees and Partial Bar Visibility Representation Extension short
Fil Lecture #11: Octilinear graph drawing of metro maps
Fil Lecture #11: Octilinear graph drawing of metro maps short
Übungen und Übungsblätter Fil LaTeX template for exercise sheets
Literatur und zusätzliche Materialien URL Lecture #1 [Reingold and Tilford 1981] Tidier Drawings of Trees
URL Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely

This paper shows that one can use LP-based methods to minimize the width of a "balanced-layered" drawing of tree, but if one desires a grid drawing the problem becomes NP-hard. 
URL Lecture #3 [Schnyder 1990] Embedding Planar Graphs on the Grid
URL Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction

Lecture #3: reference for the NP-hardness proof regarding optimally "compactifying" an orthogonal drawing of an embedded graph. 
URL Lecture #7 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs
URL Lecture #7 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs
URL Lecture #7 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs
URL Lecture #8 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry

This paper contains several applications of the crossing lemma. Be warned that the presentation is a bit dense at times. 
URL Lecture #8 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers
URL Lecture #8 [Schaefer 2020] The Graph Crossing Number and its Variants: A Survey
URL Lecture #8 Terry Tao's blog on Crossing Numbers

Terry Tao's blog entry on the crossing inequality. 
URL Lecture #8 Movie "N Is a Number: A Portrait of Paul Erdös"
URL Lecture #9 Web interface for force-directed approaches

This website gives a live demo environment (with configurable constants) and many example graphs drawn via force-directed methods. 
URL Lecture #10 [CGGKL18] The Partial Visibility Representation Extension Problem
URL Lecture #11 [Nöl14] A Survey on Automated Metro Map Layout Methods