Graphs, Geometry, and Algorithms

Course content

Qualification Goals: Graduates of this module know different geometric representations of graphs. They can gauge the algorithmic complexity of computing such representations or deciding whether such a representation exists. They understand how such representations may help to solve otherwise difficult problems and are capable of developing algorithmic methods for new problems. In many contexts, it is useful to visualize data organized in graphs. For this purpose, approaches from algorithms, graph theory and algorithmic geometry join forces. This class will be held in English. Students are encouraged (but not required) to use English in exercises and exams as well.

Content: Drawings of graphs, planar graphs, spring embeddings, contact representations, morphs, visibility graphs, intersection graphs, case studies from current research.