Table of Contents

• Morphing Planar Graph Drawings via Orthogonal Box DrawingsTherese Biedl, Anna Lubiw, Jack Spalding-Jamieson. [doi]
• How Can Biclique Covers Help in Matching Problems (Invited Talk)Otfried Cheong. [doi]
• Flips in Colorful TriangulationsRohan Acharya, Torsten Mütze, Francesco Verciani. [doi]
• Harborth's Conjecture for 4-Regular Planar GraphsDaniel J. Chang, Timothy Sun. [doi]
• Partitioning Complete Geometric Graphs on Dense Point Sets into Plane SubgraphsAdrian Dumitrescu, János Pach. [doi]
• On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar GraphsAaron Büngener, Maximilian Pfister 0002. [doi]
• The Euclidean MST-Ratio for Bi-Colored LatticesSebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian. [doi]
• Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar GraphsAaron Büngener, Michael Kaufmann 0001. [doi]
• 1-Planar Unit Distance GraphsPanna Gehér, Géza Tóth 0001. [doi]
• Connectivity-Faithful Graph DrawingAmyra Meidiana, Seok-Hee Hong 0001, Yongcheng Jing. [doi]
• Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area (Poster Abstract)Maarten Löffler. [doi]
• Knowledge Graph Builder - Constructing a Graph from Arbitrary Text Using an LLM (Software Abstract)Andreas Benno Kollegger, Alexander Erdl, Michael Hunger. [doi]
• The Parameterized Complexity Of Extending Stack LayoutsThomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg. [doi]
• String Graph with Cop Number 4 (Poster Abstract)Stephane Durocher, Myroslav Kryven, Maarten Löffler. [doi]
• From Planar via Outerplanar to Outerpath - Engineering NP-Hardness Constructions (Poster Abstract)Joshua Geis, Johannes Zink 0001. [doi]
• How Can Algorithms Help in Protecting Our Privacy (Invited Talk)Monika Henzinger. [doi]
• Weakly Leveled Planarity with Bounded SpanMichael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta 0002, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis. [doi]
• The Density Formula: One Lemma to Bound Them AllMichael Kaufmann 0001, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt. [doi]
• yFiles - From Data to Meaningful Visualizations (Software Abstract)Evmorfia N. Argyriou, Benjamin Niedermann. [doi]
• Note on Min- k-Planar Drawings of GraphsPetr Hlinený, Csenge Lili Ködmön. [doi]
• Monotone Arc Diagrams with Few BiarcsSteven Chaplick, Henry Förster, Michael Hoffmann 0001, Michael Kaufmann 0001. [doi]
• Enumeration of Intersection Graphs of x-Monotone CurvesJacob Fox, János Pach, Andrew Suk. [doi]
• AdMaTilE: Visualizing Event-Based Adjacency Matrices in a Multiple-Coordinated-Views System (Poster Abstract)Nikolaus-Mathias Herl, Velitchko Andreev Filipov. [doi]
• The Eclipse Layout Kernel (Software Abstract)Maximilian Kasperowski, Sören Domrös, Reinhard von Hanxleden. [doi]
• Constrained Outer-String RepresentationsTherese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter. [doi]
• Approximating the Crossing Number of Dense Graphs (Poster Abstract)Oriol Andreu Solé-Pi. [doi]
• Introducing Fairness in Graph Visualization (Poster Abstract)Seok-Hee Hong 0001, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli. [doi]
• CentralityViz: Comprehending Node-Centrality in Large Networks (Software Abstract)Garima Jindal, Kamalakar Karlapalem. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework ApproachMarkus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, Mirko H. Wagner. [doi]
• Quantum Algorithms for One-Sided Crossing MinimizationSusanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista. [doi]
• Graph Drawing Contest Report (Graph Drawing Contest Report)Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms. [doi]
• NodeXL - A few Clicks to Network Insights (Software Abstract)Harald Meier, Arber Ceni. [doi]
• Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a MinorVida Dujmovic, Camille La Rose. [doi]
• Parameterized Algorithms for Beyond-Planar Crossing NumbersMiriam Münch, Ignaz Rutter. [doi]
• Minimizing Switches in Cased Graph Drawings (Poster Abstract)Robert Ganian, Martin Nöllenburg, Sebastian Röder. [doi]
• GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract)Martin Nöllenburg, Sebastian Röder, Markus Wallinger. [doi]
• The Price of UpwardnessPatrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong 0001, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff 0001. [doi]
• On k-Plane Insertion into Plane DrawingsJulia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter. [doi]
• GraphTrials: Visual Proofs of Graph PropertiesHenry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong 0001, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber. [doi]
• On the Complexity of Recognizing k^+-Real Face GraphsMichael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann 0001, Fabrizio Montecchiani. [doi]
• Holes in Convex and Simple DrawingsHelena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder. [doi]
• Upward Pointset Embeddings of Planar st-GraphsCarlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani. [doi]
• Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract)Jakob Baumann, Ignaz Rutter, Dirk Sudholt. [doi]
• Boundary Labeling in a Circular OrbitAnnika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms. [doi]
• Graph Harvester (Software Abstract)Julius Deynet, Tim Hegemann, Sebastian Kempf, Alexander Wolff 0001. [doi]
• Revisiting ILP Models for Exact Crossing Minimization in Storyline DrawingsAlexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg. [doi]
• On k-Planar Graphs Without Short CyclesMichael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann 0001, Michael Kaufmann 0001, Pat Morin, Saeed Odak, Alexandra Weinberger. [doi]
• Level Planarity Is More Difficult Than We Thought (Poster Abstract)Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf. [doi]
• Bounding the Treewidth of Outer k-Planar Graphs via TriangulationsOksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff 0001. [doi]
• Separable Drawings: Extendability and Crossing-Free Hamiltonian CyclesOswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber. [doi]
• Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract)Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, Maarten van Zalk. [doi]
• Storylines with a ProtagonistTim Hegemann, Alexander Wolff 0001. [doi]
• On the Uncrossed Number of GraphsMartin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner. [doi]
• Determining Sugiyama Topology with Model Order (Poster Abstract)Sören Domrös, Reinhard von Hanxleden. [doi]
• Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded CurvatureDavid Eppstein, Michael T. Goodrich, Abraham M. Illickan. [doi]
• Bundling-Aware Graph DrawingDaniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger. [doi]
• Immersive Analytics of Graphs in Virtual Reality with GAV-VR (Software Abstract)Stefan P. Feyer, Wilhelm Kerle-Malcharek, Ying Zhang, Falk Schreiber, Karsten Klein 0001. [doi]
• Noncrossing Longest Paths and CyclesGreg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr 0001. [doi]
• Intersection Graphs with and Without Product StructureLaura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt. [doi]
• Polygonally Anchored Graph Drawing (Poster Abstract)Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich. [doi]
• The Perception of Stress in Graph DrawingsGavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, Jacob Miller 0001. [doi]