Section Nom Description
Themen und Vorlesungen Fichier Lecture #1: Introduction
Fichier Lecture #1: Introduction short
Fichier Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs
Fichier Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs short
Fichier Lecture #2: Force-Directed Algorithms
Fichier Lecture #2: Force-Directed Algorithms short
Fichier Lecture #3: Planar straight-line drawings with shift method
Fichier Lecture #3: Planar straight-line drawings with shift method short
Fichier Lecture #4: Planar Straight-Line Drawings with Schnyder Woods
Fichier Lecture #4: Planar Straight-Line Drawings with Schnyder Woods short
Fichier Lecture #5: Orthogonal Layouts
Fichier Lecture #5: Orthogonal Layouts short
Fichier Lecture #6: Upward Planar Drawings
Fichier Lecture #6: Upward Planar Drawings short
Fichier Lecture video #6a: Upward Planarity Intro
Fichier Lecture video #6b: Upward Planarity Testing
Fichier Lecture #7: Hierarchical Layouts
Fichier Lecture #7: Hierarchical Layouts short
Fichier Lecture #8: Contact Representations
Fichier Lecture #8: Contact Representations short
Fichier Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension
Fichier Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension short
Fichier Lecture #10: The Crossing Lemma
Fichier Lecture #10: The Crossing Lemma short
Fichier Lecture #11: Beyond Planarity
Fichier Lecture #11: Beyond Planarity short
Fichier Lecture #12: Octilinear Graph Drawing of Metro Maps
Fichier Lecture #12: Octilinear Graph Drawing of Metro Maps short
Literatur und zusätzliche Materialien URL Lecture #1 Supplemental Material: Compendium of Drawing Methods for Trees
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 #2 Web demo for force-directed approaches

Implemented by Philipp Kindermann.

Another website is this one here http://www.yasiv.com/graphs#
which also has a live demo environment (with configurable constants) and many example graphs drawn via force-directed methods. 
URL Lecture #4 [Schnyder 1990] Embedding Planar Graphs on the Grid
URL Lecture #5 [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 #8 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs
URL Lecture #8 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs
URL Lecture #8 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs
URL Lecture #9 [CGGKL18] The Partial Visibility Representation Extension Problem
URL Lecture #10 [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 #10 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers
URL Lecture #10 [Schaefer 2020] The Graph Crossing Number and its Variants: A Survey
URL Lecture #10 Terry Tao's blog on Crossing Numbers

Terry Tao's blog entry on the crossing inequality. 
URL Lecture #10 Movie "N Is a Number: A Portrait of Paul Erdös"
URL Lecture #12 [Nöl14] A Survey on Automated Metro Map Layout Methods
Fichier Lecture #1-12: Bonus Summary