Graph Drawing 2019

Program

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 S. Chaplick, P. Kindermann, A. Löffler, F. Thiele, A. Wolff, A. Zaft and J. Zink [Arxiv, slides]	T1
9:30 – 9:50	Representing Graphs and Hypergraphs by Touching Polygons in 3D W. Evans, P. Rzążewski, N. Saeedi, Ch.-S. Shin and A. Wolff [Arxiv, slides]	T1
9:50 – 10:10	Optimal Morphs of Planar Orthogonal Drawings II A. van Goethem, B. Speckmann and K. Verbeek [Arxiv, slides]	T1
10:10 – 10:30	Computing Stable Demers Cartograms S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S. Kobourov, J. Peltonen and M. Nöllenburg [Arxiv, slides]	T2
10:30 – 11:00	Coffee Break
Session 2	Geometric Graph Theory (chair: Seokhee Hong) Sponsor: Unicorn
11:00 – 11:20	Bundled Crossings Revisited S. Chaplick, T. C. Van Dijk, M. Kryven, J. W. Park, A. Ravsky and A. Wolff [Arxiv, slides]	T1
11:20 – 11:35	Crossing Numbers of Beyond-Planar Graphs M. Chimani, P. Kindermann, F. Montecchiani and P. Valtr [Arxiv, slides]	S
11:35 – 11:55	On the 2-Colored Crossing Number O. Aichholzer, R. Fabila-Monroy, A. Fuchs, C. Hidalgo-Toscano, I. Parada, B. Vogtenhuber and F. Javier Zaragoza Martinez [Arxiv, slides]	T1
11:55 – 12:15	Minimal Representations of Order Types by Geometric Graphs O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber and E. Welzl [Arxiv, slides]	T1
12:15 – 12:30	Balanced Schnyder Woods for Planar Triangulations: An Experimen- tal Study with Applications to Graph Drawing and Graph Separators L. Castelli Aleardi [Arxiv, slides]	S
12:30 – 14:00	Lunch Break
14:00 – 15:00	Invited Lecture (J. T. Stasko) Pushing the Boundaries of Interaction in Data Visualization [Abstract, slides]
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 A. Meidiana, S.-H. Hong, P. Eades and D. Keim [Arxiv, slides]	T2
16:20 – 16:35	Multi-Level Graph Drawing Using Infomap Clustering S.-H. Hong, P. Eades, M. Torkel, Z. Wang, D. Chae, S. Hong, D. Langerenken and H. Chafi [Arxiv, slides]	S
16:35 – 16:55	On Strict (Outer-) Confluent Graphs H. Förster, R. Ganian, F. Klute and M. Nöllenburg [Arxiv, slides]	T1
16:55 – 17:05	Short Break
Session 4	Quality Metrics (chair: Michael Bekos)
17:05 – 17:25	On the Edge-Length Ratio of Planar Graphs M. Borrazzo and F. Frati [Arxiv, slides]	T1
17:25 – 17:45	Node Overlap Removal Algorithms: A Comparative Study F. Chen, L. Piccinini, P. Poncelet and A. Sallaberry [Arxiv, slides]	T2
17:45 – 18:00	Graphs with Large Total Angular Resolution O. Aichholzer, M. Korman, Y. Okamoto, I. Parada, D. Perz, A. van Renssen and B. Vogtenhuber [Arxiv, slides]	S
18:15 – 19:45	GD Contest Live Challenge
Thursday September 19, 2019
Session 5	Arrangements (chair: Birgit Vogtenhuber) Sponsor: RSJ
9:00 – 9:20	Computing Height-Optimal Tangles Faster O. Firman, P. Kindermann, A. Ravsky, A. Wolff and J. Zink [Arxiv, slides]	T1
9:20 – 9:40	On Arrangements of Orthogonal Circles S. Chaplick, H. Förster, M. Kryven and A. Wolff [Arxiv, slides]	T1
9:40 – 10:00	Extending Simple Drawings A. Arroyo, M. Derka and I. Parada [Arxiv, slides]	T1
10:00 – 10:15	Coloring Hasse Diagrams and Disjointness Graphs of Curves J. Pach and I. Tomon [Arxiv, slides]	S
10:15 – 10:40	Coffee Break
Session 6	A Low Number of Crossings (chair: Emilio Di Giacomo) Sponsor: Tom Sawyer Software
10:40 – 11:05	Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity P. Angelini, M. Bekos, M. Kaufmann and T. Schneck [Arxiv, slides]	T2
11:05 – 11:20	The QuaSEFE Problem P. Angelini, H. Förster, M. Hoffmann, M. Kaufmann, S. Kobourov, G. Liotta and M. Patrignani [Arxiv, slides]	S
11:20 – 11:40	ChordLink: A New Hybrid Visualization Model L. Angori, W. Didimo, F. Montecchiani, D. Pagliuca and A. Tappini [Arxiv, slides]	T2
11:40 – 12:00	Stress-Plus-X (SPX) Graph Layout S. Devkota, A. Reyan Ahmed, F. De Luca, K. Isaacs and S. Kobourov [Arxiv, slides]	T2
12:00 – 12:10	Short Break
12:10 – 12:30	Best Paper in Track 1 Exact Crossing Number Parameterized by Vertex Cover P. Hliněný and A. Sankaran [Arxiv, slides]
12:30 – 14:00	Lunch Break
14:00 – 15:00	Invited Lecture (B. Walczak) Old and New Challenges in Coloring Graphs with Geometric Representations [Abstract, slides]
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 k-Plane Graphs M. Hummel, F. Klute, S. Nickel and M. Nöllenburg [Arxiv, slides]	T1
15:50 – 16:10	Graph Drawing with Morphing Partial Edges K. Misue and K. Akasaka [Arxiv, slides]	T2
16:10 – 16:30	A Note on Universal Point Sets for Planar Graphs M. Scheucher, H. Schrezenmaier and R. Steiner [Arxiv, slides]	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 S. Bhore, R. Ganian, F. Montecchiani and M. Nöllenburg [Arxiv, slides]	T1
17:00 – 17:20	Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs E. Di Giacomo, G. Liotta and F. Montecchiani [Arxiv, slides]	T1
17:20 – 18:20	Business Meeting
18:30 – 21:00	Banquet
Friday September 20, 2019
Session 9	Collinearities (chair: Ignaz Rutter) Sponsor: AVAST
9:00 – 9:20	4-Connected Triangulations on Few Lines S. Felsner [Arxiv, slides]	T1
9:20 – 9:35	Line and Plane Cover Numbers Revisited T. Biedl, S. Felsner, H. Meijer and A. Wolff [Arxiv, slides]	S
9:35 – 9:55	Drawing Planar Graphs with Few Segments on a Polynomial Grid P. Kindermann, T. Mchedlidze, T. Schneck and A. Symvonis [Arxiv, slides]	T1
9:55 – 10:15	Variants of the Segment Number of a Graph Y. Okamoto, A. Ravsky and A. Wolff [Arxiv, slides]	T1
10:15 – 10:40	Coffee Break
Session 10	Topological Graph Theory (chair: Walter Didimo) Sponsor: yWorks
10:40 – 11:05	Local and Union Page Numbers L. Merker and T. Ueckerdt [Arxiv, slides]	T1
11:05 – 11:20	Mixed Linear Layouts: Complexity, Heuristics, and Experiments P. de Col, F. Klute and M. Nöllenburg [Arxiv, slides]	S
11:20 – 11:40	Homotopy Height, Grid-Major Height and Graph-Drawing Height T. Biedl, E. Wolf Chambers, D. Eppstein, A. de Mesmay and T. Ophelders [Arxiv, slides]	T1
11:40 – 12:10	On the Edge-Vertex Ratio of Maximal Thrackles O. Aichholzer, L. Kleist, B. Klemz, F. Schröder and B. Vogthenhuber [Arxiv, slides]	T1
12:00 – 12:10	Short Break
12:10 – 12:30	Best Paper in Track 2 Symmetry Detection and Classification in Drawings of Graphs F. De Luca, Md. Iqbal Hossain and S. Kobourov [Arxiv, slides]
12:30 – 14:00	Lunch Break
Session 11	Level Planarity (chair: Alexander Wolff)
14:00 – 14:20	An SPQR-Tree-Like Embedding Representation for Upward Planarity G. Brückner, M. Himmel and I. Rutter [Arxiv, slides]	T1
14:20 – 14:40	A Natural Quadratic Approach to the Generalized Graph Layering Problem S. Mallach [Arxiv, slides]	T2
14:40 – 15:00	Graph Stories in Small Area M. Borrazzo, G. Da Lozzo, F. Frati and M. Patrignani [Arxiv, slides]	T1
15:00 – 15:20	Level-Planar Drawings with Few Slopes G. Brückner, N. Krisam and T. Mchedlidze [Arxiv, slides]	T1
15:20 – 15:50	Coffee Break
15:50 – 16:50	Invited Lecture (G. Di Battista) This is Time in/for Graph Drawing [Abstract, slides]
16:50 – 17:00	Best Presentation and Best Poster Ceremony, Closing