In honour of scientific achievements of Jan Kratochvíl, we also organize a satellite event HonzaFest on Saturday, September 21, at the building of Charles University, Malostranské naměstí 25 in Prague. Please, consider participating in this event when planning your trip. We expect the GD symposium will end on Friday afternoon around 5pm.
A PDF of the GD 2019 program is available here.
The proceedings are now available online.
We also note that this year, there will be three invited speakers.
KEY:
Track 1 (Theory): T1
Track 2 (Applied): T2
S: Short paper
Tuesday September 17, 2019 

19:00 
Welcome Reception 

Wednesday September 18, 2019 

8:30 – 9:00 
Registration 

9:00 – 9:10 
Opening 

Session 1 
Cartograms and Intersection Graphs (chair: Torsten Ueckerdt) 

9:10 – 9:30 
Stick Graphs with Length Constraints 
T1 

9:30 – 9:50 
Representing Graphs and Hypergraphs by Touching Polygons in 3D 
T1 

9:50 – 10:10 
Optimal Morphs of Planar Orthogonal Drawings II 
T1 

10:10 – 10:30 
Computing Stable Demers Cartograms 
T2 

10:30 – 11:00 
Coffee Break 

Session 2 
Geometric Graph Theory (chair: Seokhee Hong)


11:00 – 11:20 
Bundled Crossings Revisited 
T1 

11:20 – 11:35 
Crossing Numbers of BeyondPlanar Graphs 
S 

11:35 – 11:55 
On the 2Colored Crossing Number 
T1 

11:55 – 12:15 
Minimal Representations of Order Types by Geometric Graphs 
T1 

12:15 – 12:30 
Balanced Schnyder Woods for Planar Triangulations: An Experimen 
S 

12:30 – 14:00 
Lunch Break 

14:00 – 15:00 
Invited Lecture (J. T. Stasko) 

15:00 – 15:15 
Poster Pitches 

15:15 – 16:00 
Poster Exhibit 

Session 3 
Clustering (chair: Stephen Wismath) 

16:00 – 16:20 
A Quality Metric for Visualization of Clusters in Graphs 
T2 

16:20 – 16:35 
MultiLevel Graph Drawing Using Infomap Clustering 
S 

16:35 – 16:55 
On Strict (Outer) Confluent Graphs 
T1 

16:55 – 17:05 
Short Break 

Session 4 
Quality Metrics (chair: Michael Bekos) 

17:05 – 17:25 
On the EdgeLength Ratio of Planar Graphs 
T1 

17:25 – 17:45 
Node Overlap Removal Algorithms: A Comparative Study 
T2 

17:45 – 18:00 
Graphs with Large Total Angular Resolution 
S 

18:15 – 19:45 
GD Contest Live Challenge 

Thursday September 19, 2019 

Session 5 
Arrangements (chair: Birgit Vogtenhuber)


9:00 – 9:20 
Computing HeightOptimal Tangles Faster 
T1 

9:20 – 9:40 
On Arrangements of Orthogonal Circles 
T1 

9:40 – 10:00 
Extending Simple Drawings 
T1 

10:00 – 10:15 
Coloring Hasse Diagrams and Disjointness Graphs of Curves 
S 

10:15 – 10:40 
Coffee Break 

Session 6 
A Low Number of Crossings (chair: Emilio Di Giacomo)


10:40 – 11:05 
Efficient Generation of Different Topological Representations of 
T2 

11:05 – 11:20 
The QuaSEFE Problem 
S 

11:20 – 11:40 
ChordLink: A New Hybrid Visualization Model 
T2 

11:40 – 12:00 
StressPlusX (SPX) Graph Layout 
T2 

12:00 – 12:10 
Short Break 

12:10 – 12:30 
Best Paper in Track 1 

12:30 – 14:00 
Lunch Break 

14:00 – 15:00 
Invited Lecture (B. Walczak) 

15:00 – 15:30 
Coffee Break 

Session 7 
Morphing and Planarity (chair: Jan Kynčl) 

15:30 – 15:50 
Maximizing Ink in Partial Edge Drawings of kPlane Graphs 
T1 

15:50 – 16:10 
Graph Drawing with Morphing Partial Edges 
T2 

16:10 – 16:30 
A Note on Universal Point Sets for Planar Graphs 
T1 

16:30 – 16:40 
Short Break 

Session 8 
Parameterized Complexity (chair: Giordano Da Lozzo) 

16:40 – 17:00 
Parameterized Algorithms for Book Embedding Problems 
T1 

17:00 – 17:20 
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs 
T1 

17:20 – 18:20 
Business Meeting 

18:30 – 21:00 
Banquet 

Friday September 20, 2019 

Session 9 
Collinearities (chair: Ignaz Rutter)


9:00 – 9:20 
4Connected Triangulations on Few Lines 
T1 

9:20 – 9:35 
Line and Plane Cover Numbers Revisited 
S 

9:35 – 9:55 
Drawing Planar Graphs with Few Segments on a Polynomial Grid 
T1 

9:55 – 10:15 
Variants of the Segment Number of a Graph 
T1 

10:15 – 10:40 
Coffee Break 

Session 10 
Topological Graph Theory (chair: Walter Didimo)


10:40 – 11:05 
Local and Union Page Numbers 
T1 

11:05 – 11:20 
Mixed Linear Layouts: Complexity, Heuristics, and Experiments 
S 

11:20 – 11:40 
Homotopy Height, GridMajor Height and GraphDrawing Height 
T1 

11:40 – 12:10 
On the EdgeVertex Ratio of Maximal Thrackles 
T1 

12:00 – 12:10 
Short Break 

12:10 – 12:30 
Best Paper in Track 2 

12:30 – 14:00 
Lunch Break 

Session 11 
Level Planarity (chair: Alexander Wolff) 

14:00 – 14:20 
An SPQRTreeLike Embedding Representation for Upward Planarity 
T1 

14:20 – 14:40 
A Natural Quadratic Approach to the Generalized Graph Layering Problem 
T2 

14:40 – 15:00 
Graph Stories in Small Area 
T1 

15:00 – 15:20 
LevelPlanar Drawings with Few Slopes 
T1 

15:20 – 15:50 
Coffee Break 

15:50 – 16:50 
Invited Lecture (G. Di Battista) 

16:50 – 17:00 
Best Presentation and Best Poster Ceremony, Closing 
🕫 20.9.2019: The list of awards and slides of all presentations are available.
🕫 17.9.2019: The proceedings are available online.
🕫 26.8.2019: List of accepted posters published.
🕫 24.8.2019: Program available.
🕫 24.7.2019: List of accepted papers published.
🕫 18.7.2019: Call for posters published.
🕫 18.2.2019: Call for papers published.
🕫 16.10.2018: The web page was launched.
Contact: gd2019@kam.mff.cuni.cz
Local arrangements are provided by:
CONFORG