PhD School

---

The PhD school will take place at the building of Charles University, Malostranské náměstí 25, Prague, on September 16-17. There is no registration fee for the PhD school but each participant must register by filling in the registration form before September 8th.

The PhD school offers two series of lectures that would allow a deeper exploration of the subjects

Walter Didimo (Universita degli Studi di Perugia): Orthogonal Drawings of Graphs and Their Relatives,
Jan Kynčl (Charles University, Prague): Hanani–Tutte Theorems and Planarity

and two one-hour software presentations by Ulrich Foessmeier from Tom Sawyer Software and by Sebastian Müller from yWorks.

Program

---

All lectures take place in the room S5 on the second floor at the building of Charles University, Malostranské náměstí 25, Prague.

Monday September 16, 2019
8:55 – 9:00	Opening
9:00 – 10:30	Jan Kynčl: Hanani–Tutte Theorems and Planarity
10:30 – 11:00	Coffee Break
11:00 – 12:00	Ulrich Foessmeier: Tom Sawyer Software, SW presentation
12:00 – 13:00	Fouli Argyriou: yWorks, SW presentation
13:00 – 14:00	Lunch Break
14:00 – 15:30	Jan Kynčl: Hanani–Tutte Theorems and Planarity
15:30 – 16:00	Coffee Break
16:00 – 17:30	Walter Didimo: Orthogonal Drawings of Graphs and Their Relatives
Tuesday September 17, 2019
9:00 – 10:30	Walter Didimo: Orthogonal Drawings of Graphs and Their Relatives
10:30 – 11:00	Coffee Break
11:00 – 12:30	Jan Kynčl: Hanani–Tutte Theorems and Planarity
12:30 – 14:00	Lunch Break
14:00 – 15:30	Walter Didimo: Orthogonal Drawings of Graphs and Their Relatives

Hanani–Tutte Theorems and Planarity (Jan Kynčl)
Abstract: The Hanani–Tutte theorem states that a graph is planar if it has a drawing in the plane where every pair of nonadjacent edges crosses an even number of times. This classical result has several variants and has been adapted to many other types of planarity. We will focus on the most basic variants of the theorem and their proofs. We will also show how the Hanani–Tutte theorem implies a simple polynomial algorithm for planarity testing.
Literature (see Chapter 2)

Orthogonal Drawings of Graphs and Their Relatives (Walter Didimo)
Abstract: Orthogonal drawings have a long tradition and are among the most studied topics in graph drawing. They find application in many real-world domains, including software design, database design, and circuit design. This seminar focuses on a classical technique for computing effective orthogonal drawings of graphs, by considering both theoretical and practical aspects. Recent advances on the widely studied bend-minimization problem and some variants of the orthogonal drawing convention are also discussed. Among its goals, the seminar aims to suggest open problems that may stimulate further research in the graph drawing area.
Slides: Part 0 - introduction, Part 1, Part 2 and Part 3.