المقطع الاسم الوصف
Themen und Vorlesungen ملف Lecture #1: Introduction
ملف Lecture #1: Introduction short
ملف Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs
ملف Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs short
ملف Lecture #2: Force-Directed Algorithms
ملف Lecture #2: Force-Directed Algorithms short
ملف Lecture #3: Planar straight-line drawings with shift method
ملف Lecture #3: Planar straight-line drawings with shift method short
ملف Lecture #4: Planar Straight-Line Drawings with Schnyder Woods
ملف Lecture #4: Planar Straight-Line Drawings with Schnyder Woods short
ملف Lecture #5: Orthogonal Layouts
ملف Lecture #5: Orthogonal Layouts short
ملف Lecture #6: Upward Planar Drawings
ملف Lecture #6: Upward Planar Drawings short
ملف Lecture video #6a: Upward Planarity Intro
ملف Lecture video #6b: Upward Planarity Testing
ملف Lecture #7: Hierarchical Layouts
ملف Lecture #7: Hierarchical Layouts short
ملف Lecture #8: Contact Representations
ملف Lecture #8: Contact Representations short
ملف Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension
ملف Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension short
ملف Lecture #10: The Crossing Lemma
ملف Lecture #10: The Crossing Lemma short
ملف Lecture #11: Beyond Planarity
ملف Lecture #11: Beyond Planarity short
ملف Lecture #12: Octilinear Graph Drawing of Metro Maps
ملف Lecture #12: Octilinear Graph Drawing of Metro Maps short
Literatur und zusätzliche Materialien رابط الكتروني Lecture #1 Supplemental Material: Compendium of Drawing Methods for Trees
رابط الكتروني Lecture #1 [Reingold and Tilford 1981] Tidier Drawings of Trees
رابط الكتروني 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. 
رابط الكتروني 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. 
رابط الكتروني Lecture #4 [Schnyder 1990] Embedding Planar Graphs on the Grid
رابط الكتروني 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. 
رابط الكتروني Lecture #8 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs
رابط الكتروني Lecture #8 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs
رابط الكتروني Lecture #8 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs
رابط الكتروني Lecture #9 [CGGKL18] The Partial Visibility Representation Extension Problem
رابط الكتروني 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. 
رابط الكتروني Lecture #10 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers
رابط الكتروني Lecture #10 [Schaefer 2020] The Graph Crossing Number and its Variants: A Survey
رابط الكتروني Lecture #10 Terry Tao's blog on Crossing Numbers

Terry Tao's blog entry on the crossing inequality. 
رابط الكتروني Lecture #10 Movie "N Is a Number: A Portrait of Paul Erdös"
رابط الكتروني Lecture #12 [Nöl14] A Survey on Automated Metro Map Layout Methods
ملف Lecture #1-12: Bonus Summary