Program Overview

Please hover over events to view details

Detailed Schedule

Jump to Monday, Tuesday, Wednesday, Thursday, or Friday.

[T1] Track 1 Paper, [T2] Track 2 Paper

Monday, August 17
Time Event
08:30 — 09:00 PhD School Registration, Location: Thistle Complex Hallway
09:00 — 10:30 Lecture by Prof. Dr. Myroslav Kryven
10:30 — 11:00 Coffee Break
11:00 — 12:30 Lecture by Prof. Dr. Alessandra Tappini
12:30 — 14:00 Lunch Break
14:00 — 15:30 Lecture by Prof. Dr. Reyan Ahmed
15:30 — 16:00 Coffee Break
16:00 — 17:00 Experiments and Discussion by Prof. Dr. Reyan Ahmed

Tuesday, August 18
Time Event
09:00 — 10:30 Lecture by Prof. Dr. Md. Saidur Rahman
10:30 — 11:00 Coffee Break
11:00 — 12:30 Lecture by Prof. Dr. Carola Wenk
12:30 — 14:00 Lunch Break
14:00 — 15:30 Lecture by Prof. Dr. Will Evans
15:30 — 16:00 Coffee Break and Conclusion of PhD School
18:30 — 20:30 Conference Welcome Reception, Location: Residence 8 Dining Hall

Wednesday, August 19
Time Event
08:30 — 09:00 Registration, Location: Thistle Complex Hallway
09:00 — 09:10 Opening
09:10 — 09:30 Sergey Pupyrev. How to Draw a Planar Graph: An Experimental Evaluation [T2]
09:30 — 09:50 Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso and Maurizio Patrignani. Extending Biconnected Straight-Line Planar Drawings [T1]
09:50 — 10:10 Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong and Ignaz Rutter. Beyond Degree Four: Near-Orthogonal Planar Drawings [T1]
10:10 — 10:30 Vera Chekan, Robert Ganian and Viktoriia Korchemna. A Fixed-Parameter Algorithm for Extending Upward Planar Drawings [T1]
10:30 — 11:00 Coffee Break, Location: Thistle Complex Hallway
11:00 — 11:20 Markus Wallinger, Oscar Navarro and Stephen Kobourov. Minimum-Width Drawings of Trees with Sized Vertices [T2]
11:20 — 11:40 Anna Lubiw and Marcus Schaefer. Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals [T1]
11:40 — 12:00 Todor Antić, Jiří Fiala, Jelena Glišić, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Krisztina Szilágyi and Pavel Valtr. How Close is a Tree to a Euclidean Minimum Spanning Tree? [T1]
12:00 — 12:20 Thomas Depian, Thomas C. Van Dijk and Martin Nöllenburg. Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints [T2]
12:20 — 14:00 Lunch, Location: Decew Dining Hall
14:00 — 15:00
  • Abu Reyan Ahmed, Cesim Erten, Stephen Kobourov, Jonah Lotz, Jacob Miller and Hamlet Taraz. Size Should Not Matter: Evaluating Network Visualizations with Stress (Track 2, poster)
  • Michael Bekos, Thomas Depian, Stefan Felsner, Michael Kaufmann, Philipp Kindermann, Fabrizio Montecchiani, Maria Eleni Pavlidi, Alexandra Weinberger, Alexander Wolff and Johannes Zink. On the Recognition of Outerplanar Graphs with Queue Number 1 (Track 1, poster)
  • Anežka Kasalová, Vojtěch Vincíbr, Zuzana Reiffersová and Petr Filip. Independence of the Lower Bound for Geometric Triangulation Drawings on the Number of Chains (Track 1, poster)
  • Stefan Felsner, Carolina Haase, Philipp Kindermann and William Lenhart. Circular Outside-Obstacle Representations of 2-trees (Track 1, poster)
  • Timo Brand, Sebastian Damrich, Stephen Kobourov and Jacob Miller. Toroidal Graph Drawing by Multidimensional Scaling (Track 2, poster)
  • Giordano Andreola, Giordano Da Lozzo and Marco D'Elia. Hamiltonian Properties of Cycle-Trees (Track 1, poster)
  • Thomas C. Van Dijk, Soeren Terziadis and Morris Boers. Newey: An Algorithmically-Assisted Editor for High-Quality Fully Labelled Transit Map Layout (Track 2, poster)
  • Tim Hegemann, Dominik Jilg, Marie Diana Sieper and Samuel Wolf. Chunky Chains: Graph Drawing on Narrow Screens (Track 2, poster)
  • Dante Tostado Cortes and Debajyoti Mondal. RACTrix: Interactive Visual Summaries for Exploring Signed Networks (Track 2, poster)
15:00 — 15:30 Coffee Break, Location: Thistle Complex Hallway
15:30 — 15:50 Stefan Felsner, Jędrzej Hodor, Giacomo Ortali and Alexander Wolff. Navigating Posets with Few Maps [T1]
15:50 — 16:10 Marcel Nöhre and Gerd Stumme. Node Labeling in Line Diagrams of Ordered Sets [T2]
16:10 — 16:30 Michael A. Bekos, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Luca Grilli, Maria Eleni Pavlidi, Alessandra Tappini and Alexandra Weinberger. Stack and Queue Layouts with Defects [T1]

Thursday, August 20
Time Event
09:00 — 09:20 Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter and Marie Diana Sieper. Monotone Clustered Level Planarity [T1]
09:20 — 09:40 Saeed Odak, Jonathan Rollin and Torben Scheele. On 2-Layer k-Matching-Planar Graphs [T1]
09:40 — 10:00 Alexander Firbas, Robert Ganian, Sylvain Meunier and Martin Nöllenburg. Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms [T1]
10:00 — 10:15 Yasuaki Kobayashi and Yuto Okada. 2-Layer Fan-Planarity in Polynomial Time [T1, short]
10:15 — 10:30 Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani and Martin Nöllenburg. On the Complexity of Extending Storylines [T1, short]
10:30 — 11:00 Coffee Break, Location: Thistle Complex Hallway
11:00 — 11:20 Sara Di Bartolomeo, Fabrizio Montecchiani and Andrea Tomassoni. CLIC: Highlighting Clique Motifs in Biofabric Visualizations [T2]
11:20 — 11:40 Michal Katrlík. Tight Leading-Term Bounds for the Z2-Genus of Complete Graphs [T1]
11:40 — 12:00 Alexandra Weinberger and Ji Zeng. What induces plane structures in complete graph drawings? [T1]
12:00 — 12:20 Stefan Felsner. Antipodal Pairs and Crossing Numbers [T1]
12:20 — 14:00 Lunch, Location: Decew Dining Hall
15:00 — 15:30 Coffee Break, Location: Thistle Complex Hallway
15:30 — 15:50 Alessandro Palma, Sara Di Bartolomeo and Marco Angelini. Weaving (Bio)fabric: A Benchmark for Scalability through Progressive Sampling Methods [T2]
15:50 — 16:10 Timo Brand, Henry Förster, Stephen Kobourov, Daniel Kohrt, Robin Schukrafft, Markus Wallinger and Johannes Zink. Using Reinforcement Learning to Optimize the Global and Local Crossing Number [T2]
16:10 — 16:30 Gavin J. Mooney, Michael Wybrow and Helen C. Purchase. Does graph structure affect drawing quality? [T2]
16:30 — 17:30 Business Meeting, Location: Thistle 247
17:30 — 23:00 Social Dinner, Queen Victoria Place, Niagara Falls

Friday, August 21
Time Event
09:00 — 09:20 Kazuo Misue and Naoto Kikuta. Opacity-Modulated Edge Drawing [T2]
09:20 — 09:40 Henry Förster, Michael Hoffmann, Stephen Kobourov, Maria Eleni Pavlidi, Alexandra Weinberger and Johannes Zink. Weighted Book Thickness [T1]
09:40 — 10:00 Todor Antić, Vít Jelínek, Jan Kratochvíl and Peter Stumpf. Two Results on Outer-String Graphs [T1]
10:00 — 10:15 Robert Ganian, Philipp Mauve and Vaishali Surianarayanan. Circle Graph 3-Coloring: Can Simplicity Beat SAT? [T2, short]
10:15 — 10:30 Amyra Meidiana and Seok-Hee Hong. Fast UMAP-based Graph Drawing [T2, short]
10:30 — 11:00 Coffee Break, Location: Thistle Complex Hallway
11:00 — 11:20 Stefan Felsner, Kolja Knauer, Yasumi Kogo and Bobby Miraftab. 1-Planar Drawings of Products of Cycles [T1]
11:20 — 11:40 Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Aikaterini Maria Ntasiou, Maria Eleni Pavlidi and Soeren Terziadis. On the 2-Bend Slope Number of 1-Planar Graphs [T1]
11:40 — 12:00 Aaron Büngener, Jakob Franz, Michael Kaufmann and Maximilian Pfister. A first view on the density of 5-planar graphs [T1]
12:00 — 12:20 Miriam Goetze, Michael Kaufmann and Soeren Terziadis. On t-colorable k-plane drawings [T1]
12:20 — 14:00 Lunch, Location: Decew Dining Hall
15:00 — 15:30 Coffee Break, Location: Thistle Complex Hallway
15:30 — 15:50 Thomas Depian, Joseph Dorfer, Boris Klemz, Matthias Pfretzschner and Lena Schlipf. Point Set Embeddability with List Constraints [T1]
15:50 — 16:10 Kelvin Luu and Csaba Tóth. Geometric $(1+\varepsilon)$-Spanners with Few Crossings [T1]
16:10 — 16:30 Oswin Aichholzer, Joseph Dorfer, Peter Kramer, Christian Rieck and Birgit Vogtenhuber. Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees [T1]
16:45 — 17:00 Closing Remarks & Award Ceremony, Location: Thistle 247