Program Overview

  Open as PDF

Detailed Schedule

Note for presenters: Please consider the provided information when preparing your presentation or poster.

The proceedings and the booklet are available online.

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

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

Monday, September 16
TimeEvent
08:30 — 09:00Registration, Lecture Hall GM3
09:00 — 10:30Lecture
10:30 — 11:00Coffee Break
11:00 — 12:00Exercises & Discussion
12:00 — 14:00Individual Lunch Break
14:00 — 15:30Lecture
15:30 — 16:00Coffee Break
16:00 — 17:00Exercises & Discussion

Tuesday, September 17
TimeEvent
09:00 — 10:30Lecture
10:30 — 11:00Coffee Break
11:00 — 12:00Exercises & Discussion
12:00 — 14:00Individual Lunch Break
14:00 — 15:30Lecture
15:30 — 16:00Coffee Break
16:00 — 17:00Exercises & Discussion
19:00 — 21:00Welcome Reception, TUtheSky

Wednesday, September 18
TimeEvent
08:30 — 09:00Registration, TUtheSky
09:00 — 09:15Opening
09:15 — 09:35Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner. On the Uncrossed Number of Graphs [Slides] [T1]
09:35 — 09:55Aaron Büngener and Michael Kaufmann. Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs [Slides] [T1]
09:55 — 10:15Aaron Büngener and Maximilian Pfister. On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs [Slides] [T1]
10:15 — 10:30Panna Gehér and Géza Tóth. 1-Planar Unit Distance Graphs [Slides] [S]
10:30 — 11:00Coffee Break, TUtheSky
11:00 — 11:20Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. Bundling-Aware Graph Drawing [Slides] [T2]
11:20 — 11:40Amyra Meidiana, Seok-Hee Hong, and Yongcheng Jing. Connectivity-Faithful Graph Drawing [Slides] [T2]
11:40 — 12:00Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller. The Perception of Stress in Graph Drawings [Slides] [T2]
12:00 — 12:20Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg. Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings [Slides] [T2]
12:20 — 14:00Lunch, Mensa "Freihaus"
14:00 — 14:20Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg. The Parameterized Complexity of Extending Stack Layouts [Slides] [T1]
14:20 — 14:40Miriam Münch and Ignaz Rutter. Parameterized Algorithms for Beyond Planar Crossing Numbers [Slides] [T1]
14:40 — 14:55Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter. On k-Plane Insertion into Plane Drawings [Slides] [S]
15:15 — 16:15

Poster Session & Software Exhibition, TUtheSky & Room BA 10A

Exhibited Posters:

Exhibited Software:

15:15 — 16:15Coffee Break, TUtheSky
16:15 — 16:20Introduction to best papers
16:20 — 16:40Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M Reddy, Felix Schröder, and Torsten Ueckerdt. The Density Formula: One Lemma to Bound Them All [Slides] [T1]
16:40 — 17:00Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties [Slides] [T2]

Thursday, September 19
TimeEvent
09:00 — 09:20Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, and Mirko H. Wagner. Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach [Slides] [T1]
09:20 — 09:40Tim Hegemann and Alexander Wolff. Storylines with a Protagonist [Slides] [T2]
09:40 — 09:55Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum Algorithms for One-Sided Crossing Minimization [Slides] [S]
09:55 — 10:15Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, and Jules Wulms. Boundary Labeling in a Circular Orbit [Slides] [T1]
10:15 — 10:30Adrian Dumitrescu and János Pach (pres. by Géza Tóth). Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs [Slides] [S]
10:30 — 11:00Coffee Break, TUtheSky
11:00 — 11:20Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt. Intersection Graphs with and Without Product Structure [Slides] [T1]
11:20 — 11:40Vida Dujmović and Camille La Rose. Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors [Slides] [T1]
11:40 — 12:00Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger. On k-planar Graphs without Short Cycles [Slides] [T1]
12:00 — 12:20Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, and Alexander Wolff. Bounding the Treewidth of Outer k-Planar Graphs via Triangulations [Slides] [T1]
12:20 — 14:00Lunch, Mensa "Freihaus"
15:00 — 15:30Coffee Break, TUtheSky
15:30 — 15:50Jacob Fox, János Pach, and Andrew Suk. Enumeration of intersection graphs of $$x$$-monotone curves [Slides] [T1]
15:50 — 16:05Helena Bergold, Joachim Orthaber, Manfred Scheucher, and Felix Schröder. Holes in Convex and Simple Drawings [Slides] [S]
16:05 — 16:25Rohan Acharya, Torsten Mütze, and Francesco Verciani. Flips in Colorful Triangulations [Slides] [T1]
16:25 — 16:45Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. The Euclidean MST-ratio for Bi-colored Lattices [Slides] [T1]
16:50 — 17:45Business Meeting, TUtheSky
18:15- 18:45GD Tram Ride from Karlsplatz to Social Dinner venue
19:00 — 23:00 Social Dinner, Restaurant "Das Campus"

Friday, September 20
TimeEvent
09:00 — 09:20Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, and Ignaz Rutter. Constrained Outer-String Representations [Slides] [T1]
09:20 — 09:35Daniel J. Chang and Timothy Sun. Harborth's Conjecture for 4-Regular Planar Graphs [Slides] [S]
09:35 — 09:50Petr Hliněný and Lili Ködmön. Note on Min-k-Planar Drawings of Graphs [Slides] [S]
09:50 — 10:10David Eppstein, Michael T. Goodrich, and Abraham M. Illickan. Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature [Slides] [T1]
10:10 — 10:30Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, and Pavel Valtr. Noncrossing Longest Paths and Cycles [Slides] [T1]
10:30 — 11:00Coffee Break, TUtheSky
11:00 — 11:20Steven Chaplick, Henry Förster, Michael Hoffmann, and Michael Kaufmann. Monotone Arc Diagrams with Few Biarcs [Slides] [T1]
11:20 — 11:40Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber. Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles [Slides] [T1]
11:40 — 12:00Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. Morphing Planar Graph Drawings via Orthogonal Box Drawings [Slides] [T1]
12:00 — 12:20Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, and Fabrizio Montecchiani. On the Complexity of Recognizing $$k^+$$-Real Face Graphs [Slides] [T1]
12:20 — 14:00Lunch, Mensa "Freihaus"
15:00 — 15:30Coffee Break, TUtheSky
15:30 — 15:50Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, and Alexander Wolff. The Price of Upwardness [Slides] [T1]
15:50 — 16:10Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, and Maurizio Patrignani. Upward Pointset Embeddings of Planar st-Graphs [Slides] [T1]
16:10 — 16:30Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, and Ioannis G. Tollis. Weakly Leveled Planarity with Bounded Span [Slides] [T1]
16:30 — 16:45Closing Remarks & Award Ceremony, TUtheSky