Accepted Papers

  • Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow and Simon Weber - The Complexity of Recognizing Geometric Hypergraphs
  • Velitchko Filipov, Davide Ceneda, Daniel Archambault and Alessio Arleo - TimeLighting: Guidance-enhanced exploration of 2D Projections of Temporal Graphs
  • Paul Jungeblut - On the Complexity of Lombardi Graph Drawing
  • Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvil and Alexander Wolff - The Parametrized Complexity of the Segment Number
  • Olivier Bernardi, Éric Fusy and Shizhe Liang - A Schnyder-type drawing algorithm for 5-connected triangulations
  • Cornelius Brand, Robert Ganian, Sebastian Röder and Florian Schager - Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
  • Petr Chmel and Vít Jelínek - String graphs with precise number of intersections
  • David Eppstein - On the Biplanarity of Blowups
  • Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer and Falk Schreiber - CelticGraph: Drawing Graphs as Celtic Knots and Links
  • Carolina Haase, Philipp Kindermann, Giuseppe Liotta and William J. Lenhart - Mutual Witness Proximity Drawings of Isomorphic Trees
  • Walter Didimo, Fedor Fomin, Petr Golovach, Tanmay Inamdar, Stephen Kobourov and Marie Sieper - Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
  • Philipp Kindermann, Jan Kratochvil, Giuseppe Liotta and Pavel Valtr - Three Edge-disjoint Plane Spanning Paths in a Point Set
  • Jacob Miller, Mohammad Ghoniem, Hsiang-Yun Wu and Helen Purchase - On the Perception of Small Subgraphs
  • Jacob Miller, Vahan Huroyan and Stephen Kobourov - Balancing between the Local and Global Structures (LGS) in Graph Embedding
  • Marco Caoduro and András Sebő - Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs
  • Csaba Toth - On RAC Drawings of Graphs with Two Bends per Edge
  • Raphael Steiner - A logarithmic bound for simultaneous embeddings of planar graphs
  • Jonathan Klawitter and Johannes Zink - Tree Drawings with Columns
  • Giacomo Ortali, Giuseppe Liotta, Walter Didimo, Fabrizio Montecchiani and Emilio Di Giacomo - On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
  • Niloufar Fuladi, Alfredo Hubard and Arnaud de Mesmay - Degenerate crossing number and signed reversal distance
  • Liana Khazaliya, Fabrizio Montecchiani, Bart M. P. Jansen, Giuseppe Liotta, Kirill Simonov and Philipp Kindermann - Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth
  • Petr Hlineny and Tomáš Masařík - Minimizing an Uncrossed Collection of Drawings
  • Tim Hegemann and Alexander Wolff - A Simple Pipeline for Orthogonal Graph Drawing
  • Patricia Bachmann, Ignaz Rutter and Peter Stumpf - On the 3-Coloring of Circle Graphs
  • Carla Binucci, Henry Förster, Julia Katheder and Alessandra Tappini - Evaluating Animation Parameters for Morphing Edge Drawings
  • Simon D. Fink, Matthias Pfretzschner and Ignaz Rutter - Parameterized Complexity of Simultaneous Planarity
  • Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler and Günter Rote - Removing Popular Faces in Curve Arrangements
  • Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister and Lena Schlipf - Weakly and Strongly Fan-Planar Graphs
  • André Schulz - Side-contact representations of 3d convex polygons: New results for complete bipartite graphs
  • Oswin Aichholzer, Birgit Vogtenhuber and Alexandra Weinberger - Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs
  • Martin Nöllenburg and Sergey Pupyrev - On Families of Planar DAGs with Constant Stack Number
  • Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin and Alessandra Tappini - Min-k-planar Drawings of Graphs
  • János Pach, Morteza Saghafian and Patrick Schnider - Decomposition of Geometric Graphs into Star Forests
  • Martin Nöllenburg and Markus Wallinger - Computing Hive Plots: A Combinatorial Framework
  • Alvin Chiu, David Eppstein and Michael Goodrich - Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs
  • Matt DeVos, Danielle Rogers and Alexandra Wesolek - On Minimizing the Energy of a Spherical Graph Representation
  • Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa and Timothy Zapp - Cops and Robbers on 1-Planar Graphs
  • Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher and Birgit Vogtenhuber - Bichromatic Perfect Matchings with Crossings

Accepted Posters

  • Olivier Devillers and Sylvain Lazard - One-Bend Drawing of $K_n$ in 3D, revisited
  • Tamara Mchedlidze, Antonios Symvonis and Athanasios Tolias - Accurate and simple metaphoric maps
  • Simon van Wageningen, Tamara Mchedlidze and Alexandru Telea - Beyond Planarity: A Spring-Based Approach
  • Shion Fukuzawa, Michael Goodrich and Sandy Irani - Quantum Tutte Embeddings
  • David Eppstein - The Widths of Strict Outerconfluent Graphs
  • Todor Antić - Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar
  • Sara Di Bartolomeo, Eduardo Puerta, Connor Wilson, Tarik Cronvrsanin and Cody Dunne - A collection of benchmark datasets for evaluating graph layout algorithms
  • Evmorfia Argyriou, Jens Böhm, Anne Eberle, Julius Gonser, Anna-Lena Lumpp, Benjamin Niedermann and Fabian Schwarzkopf - Editing Graph Visualizations by Prompting Large Language Models
  • Carolina Haase and Philipp Kindermann - On Layered Area-Proportional Rectangle Contact Representations
  • Simon D. Fink and Andreas Strobl - odgf-python -- A Python Interface for the Open Graph Drawing Framework
  • Erin Chambers, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Maarten Löffler and Sarah Percival - Drawing Reeb Graphs
  • Felix Klesen, Jacob Miller, Fabrizio Montecchiani, Martin Nöllenburg and Markus Wallinger - What Happens at Dagstuhl? Uncovering Patterns through Visualization