GD 2026

The 34th International Symposium on Graph Drawing and Network Visualization will be held at Brock University in St. Catharines, Ontario, Canada from August 17-21, 2026. A PhD school will take place on August 17-18, 2026.

Accepted Papers

  • Yasuaki Kobayashi and Yuto Okada. 2-Layer Fan-Planarity in Polynomial Time (Track 1, short)
  • Oswin Aichholzer, Joseph Dorfer, Peter Kramer, Christian Rieck and Birgit Vogtenhuber. Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees (Track 1, long)
  • Stefan Felsner. Antipodal Pairs and Crossing Numbers (Track 1, long)
  • Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani and Martin Nöllenburg. On the Complexity of Extending Storylines (Track 1, short)
  • Alexandra Weinberger and Ji Zeng. What induces plane structures in complete graph drawings? (Track 1, long)
  • Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Aikaterini Maria Ntasiou, Maria Eleni Pavlidi and Soeren Terziadis (Track 1, long). On the 2-Bend Slope Number of 1-Planar Graphs
  • Anna Lubiw and Marcus Schaefer. Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals (Track 1, long)
  • Miriam Goetze, Michael Kaufmann and Soeren Terziadis. On t-colorable k-plane drawings (Track 1, long)
  • Robert Ganian, Philipp Mauve and Vaishali Surianarayanan. Circle Graph 3-Coloring: Can Simplicity Beat SAT? (Track 2, short)
  • Sara Di Bartolomeo, Fabrizio Montecchiani and Andrea Tomassoni. Clic: Highlighting Clique Motifs in Biofabric Visualizations (Track 2, long)
  • Aaron Büngener, Jakob Franz, Michael Kaufmann and Maximilian Pfister. A first view on the density of 5-planar graphs (Track 1, long)
  • Alexander Firbas, Robert Ganian, Sylvain Meunier and Martin Nöllenburg. Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms (Track 1, long)
  • 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 (Track 1, long)
  • Vera Chekan, Robert Ganian and Viktoriia Korchemna. A Fixed-Parameter Algorithm for Extending Upward Planar Drawings (Track 1, long)
  • Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter and Marie Diana Sieper. Monotone Clustered Level Planarity (Track 1, long)
  • Stefan Felsner, Jędrzej Hodor, Giacomo Ortali and Alexander Wolff. Navigating Posets with Few Maps (Track 1, long)
  • Kelvin Luu and Csaba Tóth. Geometric $(1+\varepsilon)$-Spanners with Few Crossings (Track 1, long)
  • Michal Katrlík. Tight Leading-Term Bounds for the Z2-Genus of Complete Graphs (Track 1, long)
  • Gavin J. Mooney, Michael Wybrow and Helen C. Purchase. Does graph structure affect drawing quality? (Track 2, long)
  • Kazuo Misue and Naoto Kikuta. Opacity-Modulated Edge Drawing (Track 2, long)
  • Henry Förster, Michael Hoffmann, Stephen Kobourov, Maria Eleni Pavlidi, Alexandra Weinberger and Johannes Zink. Weighted Book Thickness (Track 1, long)
  • Thomas Depian, Thomas C. Van Dijk and Martin Nöllenburg. Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints (Track 2, long)
  • 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 (Track 1, long)
  • Todor Antić, Vít Jelínek, Jan Kratochvíl and Peter Stumpf. Two Results on Outer-String Graphs (Track 1, long)
  • Alessandro Palma, Sara Di Bartolomeo and Marco Angelini. Weaving (Bio)fabric: A Benchmark for Scalability through Progressive Sampling Methods (Track 2, long)
  • 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 (Track 2, long)
  • Markus Wallinger, Oscar Navarro and Stephen Kobourov. Minimum-Width Drawings of Trees with Sized Vertices (Track 2, long)
  • Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong and Ignaz Rutter. Beyond Degree Four: Near-Orthogonal Planar Drawings (Track 1, long)
  • Thomas Depian, Joseph Dorfer, Boris Klemz, Matthias Pfretzschner and Lena Schlipf. Point Set Embeddability with List Constraints (Track 1, long)
  • Stefan Felsner, Kolja Knauer, Yasumi Kogo and Bobby Miraftab. 1-Planar Drawings of Products of Cycles (Track 1, long)
  • Saeed Odak, Jonathan Rollin and Torben Scheele. On 2-Layer k-Matching-Planar Graphs (Track 1, long)
  • Sergey Pupyrev. How to Draw a Planar Graph: An Experimental Evaluation (Track 2, long)
  • Marcel Nöhre and Gerd Stumme. Node Labeling in Line Diagrams of Ordered Sets (Track 2, long)
  • 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 (Track 1, long). How Close is a Tree to a Euclidean Minimum Spanning Tree? (Track 1, long)
  • Amyra Meidiana and Seok-Hee Hong. Fast UMAP-based Graph Drawing (Track 2, short)

Posters

  • 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)