GD 2024

The 32nd International Symposium on Graph Drawing and Network Visualization will be held in Vienna, Austria from September 18-20, 2024. A pre-conference PhD school will take place on September 16-17, 2024.

Program Overview

  Open as PDF

Preliminary Schedule

Please note that the following schedule is only tentative.

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

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

Monday, September 16
TimeEvent
08:30 - 09:00Registration, Room GM3
09:00 - 12:00

Phd School:
Philipp Kindermann. Reducing Connectivity Requirements: SPQR-Trees and Block-Cut-Trees

Room GM3
12:00 - 14:00Free time for individual lunch break
14:00 - 17:00

Phd School:
Tamara Mchedlidze. European Value Maps — From Theory to Application

Room GM3
Tuesday, September 17
TimeEvent
09:00 - 12:00

Phd School:
Thekla Hamm. Parameterized Algorithms and Few Crossings

Room GM3
12:00 - 14:00Free time for individual lunch break
14:00 - 17:00

Phd School:
Manfred Scheucher. Using SAT Solvers in Combinatorial Geometry and Graph Drawing

Room GM3

19:00 - 21:00Welcome Reception, TUtheSky
Wednesday, September 18
TimeEvent
08:30 - 09:00Registration, TUtheSky
09:00 - 09:15Opening
Session 1TUtheSky
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 [T1]
09:35 - 09:55Aaron Büngener and Michael Kaufmann. Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs [T1]
09:55 - 10:15Maximilian Pfister and Aaron Büngener. On the edge density of bipartite 3-planar and bipartite gap-planar graphs [T1]
10:15 - 10:30Geza Toth and Gehér Panna. 1-planar unit distance graphs [S]
10:30 - 11:00Coffee Break, TUtheSky
Session 2TUtheSky
11:00 - 11:20Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini and Markus Wallinger. Bundling-Aware Graph Drawing [T2]
11:20 - 11:40Amyra Meidiana, Seok-Hee Hong and Yongcheng Jing. Connectivity-Faithful Graph Drawing [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 [T2]
12:00 - 12:20Alexander Dobler, Michael Jünger, Paul Jünger, Julian Meffert, Petra Mutzel and Martin Nöllenburg. Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings [T2]
12:20 - 14:00Lunch, Mensa Freihaus
Session 3TUtheSky
14:00 - 14:20Thomas Depian, Simon Dominik Fink, Robert Ganian and Martin Nöllenburg. The Parameterized Complexity of Extending Stack Layouts [T1]
14:20 - 14:40Miriam Münch and Ignaz Rutter. Parameterized Algorithms for Beyond Planar Crossing Numbers [T1]
14:40 - 14:55Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada and Ignaz Rutter. On k-Plane Insertion into Plane Drawings [S]
14:55 - 15:15Poster Teasers, TUtheSky
15:15 - 16:15

Poster & Software Session, TUtheSky & Room BA10A

Exhibited Posters:

  • Joshua Geis and Johannes Zink. From Planar via Outerplanar to Outerpath – Engineering NP-hardness Constructions
  • Robert Ganian, Martin Nöllenburg and Sebastian Röder. Minimizing Switches in Cased Graph Drawings
  • Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani and Maarten von Zalk. Graph-Drawing Supported Identification of Influential Students at Schools
  • Martin Nöllenburg, Sebastian Röder and Markus Wallinger. gdMetriX - A networkX Extension for Graph Drawing Metrics
  • Niki Herl and Velitchko Filipov. Visualizing Temporal Adjacency Matrices
  • Maarten Löffler. Strict upward planar grid drawings of binary trees with minimal area
  • Sören Domrös and Reinhard von Hanxleden. Determining Sugiyama Topology with Model Order
  • Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg and Tommaso Piselli.
    • Introducing Fairness in Graph Visualization</li>
  • Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter and Peter Stumpf. Level Planarity Is More Difficult Than We Thought
  • Jakob Baumann, Ignaz Rutter and Dirk Sudholt. Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
  • Alvin Chiu, Ahmed Eldawy and Michael Goodrich. Geospatial Force-Directed Graph Drawing
  • Stephane Durocher, Myroslav Kryven and Maarten Löffler. String graph with cop number 4
  • Oriol Solé. Approximating the crossing number of dense graphs

Exhibited Software:

15:15 - 16:15Coffee Break, TUtheSky
Session 4Best Papers Session, 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 [T1]
16:40 - 17:00Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties [T2]
17:00 - 18:30GD Contest (Room GM3) & Software Exhibition (Room BA10A)
Thursday, September 19
TimeEvent
Session 5TUtheSky
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 [T1]
09:20 - 09:40Tim Hegemann and Alexander Wolff. Storylines with a Protagonist [T2]
09:40 - 09:55Susanna Caroppo, Giordano Da Lozzo and Giuseppe Di Battista. Quantum Algorithms for One-Sided Crossing Minimization [S]
09:55 - 10:15Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger and Jules Wulms. Boundary Labeling in a Circular Orbit [T1]
10:15 - 10:30Adrian Dumitrescu and Janos Pach. Partitioning complete geometric graphs into plane subgraphs [S]
10:30 - 11:00Coffee Break, TUtheSky
Session 6Sponsored by yWorks, TUtheSky
11:00 - 11:20Laura Merker, Lena Scherzer, Samuel Schneider and Torsten Ueckerdt. Geometric Graphs with and without Product Structure [T1]
11:20 - 11:40Vida Dujmovic and Camille La Rose. Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors [T1]
11:40 - 12:00Michael Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak and Alexandra Weinberger. On k-planar Graphs without Short Cycles [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 [T1]
12:20 - 14:00Lunch, Mensa Freihaus
14:00 - 15:00Invited Talk, TUtheSky
Otfried Cheong. How Can Biclique Covers Help in Matching Problems
15:00 - 15:30Coffee Break, TUtheSky
Session 7Sponsored by Tom Sawyer Software, TUtheSky
15:30 - 15:50Jacob Fox, Janos Pach and Andrew Suk. Enumeration of intersection graphs of $$x$$-monotone curves [T1]
15:50 - 16:05Helena Bergold, Joachim Orthaber, Manfred Scheucher and Felix Schröder. Holes in Convex and Simple Drawings [S]
16:05 - 16:25Rohan Acharya, Torsten Mütze and Francesco Verciani. Flips in colorful triangulations [T1]
16:25 - 16:45Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner and Morteza Saghafian. The Euclidean MST-ratio of Bi-colored Lattices [T1]
16:50 - 17:45Business Meeting, TUtheSky
18:15- 18:45Tram Ride
19:00 - 23:00 Social Dinner, "Das Campus"
Friday, September 20
TimeEvent
Session 8TUtheSky
09:00 - 09:20Therese Biedl, Sabine Cornelsen, Jan Kratochvil and Ignaz Rutter. Constrained Outer-String Representations [T1]
09:20 - 09:35Daniel J. Chang and Timothy Sun. Harborth's conjecture for 4-regular planar graphs [S]
09:35 - 09:50Petr Hlineny and Lili Ködmön. Note on Min-k-Planar Drawings of Graphs [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 [T1]
10:10 - 10:30Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba Tóth, Pavel Valtr and Jean-Lou De Carufel. Noncrossing Longest Paths and Cycles [T1]
10:30 - 11:00Coffee Break, TUtheSky
Session 9TUtheSky
11:00 - 11:20Michael Hoffmann, Michael Kaufmann, Henry Förster and Steven Chaplick. Monotone Arc Diagrams with few Biarcs [T1]
11:20 - 11:40Oswin Aichholzer, Joachim Orthaber and Birgit Vogtenhuber. Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles [T1]
11:40 - 12:00Therese Biedl, Anna Lubiw and Jack Spalding-Jamieson. Morphing Planar Graph Drawings via Orthogonal Box Drawings [T1]
12:00 - 12:20Michael Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann and Fabrizio Montecchiani. On the Complexity of Recognizing $$k^+$$-Real Face Graphs [T1]
12:20 - 14:00Lunch, Mensa Freihaus
14:00 - 15:00Invited Talk, TUtheSky
Monika Henzinger. How Can Algorithms Help in Protecting our Privacy
15:00 - 15:30Coffee Break, TUtheSky
Session 10TUtheSky
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 [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 st-Graphs [T1]
16:10 - 16:30Michael Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter and Ioannis Tollis. Weakly Leveled Planarity with Bounded Span [T1]
16:30 - 16:45Closing Remarks & Award Ceremony, TUtheSky