Tema	Nombre	Descripción
Topics and Lectures	Lecture 1a: Introduction
	Lecture 1a: Introduction (long)
	Lecture 1b: Divide and Conquer: Trees and Series-Parallel Graphs
	Lecture 1b: Divide and Conquer: Trees and Series-Parallel Graphs (long)
	Lecture 2: Force-directed Algorithms
	Lecture 2: Force-directed Algorithms (long)
	Lecture 3: Canonical Order and Shift Method
	Lecture 3: Canonical Order and Shift Method (long)
	Lecture 4: Schnyder's Method for Drawing Planar Graphs
	Lecture 4: Schnyder's Method for Drawing Planar Graphs (long)
	Lecture 6: Upward Planarity
	Lecture 6: Upward Planarity (long)
	Lecture 5: Orthogonal Graph Drawing
	Lecture 5: Orthogonal Graph Drawing (long)
	Lecture 7: Contact Representations
	Lecture 7: Contact Representations (long)
	Lecture 8: Hierarchical Layouts
	Lecutre 8: Hierarchical Layouts (long)
	Lecture 9: SPQR-Trees and Partial Representation Extension for Epsilon-Bar Visibility
	Lecture 9: SPQR-Trees and Partial Representation Extension for Epsilon-Bar Visibility (long)
	Lecture 10: Crossing Lemma and Applications
	Lecture 10: Crossing Lemma and Applications (long)
	Lecture 11: Beyond Planarity
	Lecture 11: Beyond Planarity (long)
	Lecture 12: Schematic Maps
	Lecture 12: Schematic Maps (long)
Tutorials and Exercise Sheets	LaTeX Template