default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd GD 2025: Norrköping, Sweden
- Vida Dujmovic
, Fabrizio Montecchiani:
33rd International Symposium on Graph Drawing and Network Visualization, GD 2025, Norrköping, Sweden, September 24-26, 2025. LIPIcs 357, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-403-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Hans L. Bodlaender:
A Sketch of Parameterized Complexity (Invited Talk). 1:1-1:1 - Huamin Qu:
Transforming Graph Visualization through AI and Human-AI Collaboration (Invited Talk). 2:1-2:1 - Tomasz Krawczyk:
On the Structure of Normalized Models of Circular-Arc Graphs I. Hsu's Approach. 3:1-3:15 - Simon D. Fink, Miriam Münch, Matthias Pfretzschner, Ignaz Rutter:
Heuristics for Exact 1-Planarity Testing. 4:1-4:19 - Oswin Aichholzer, Joseph Dorfer, Birgit Vogtenhuber:
Constrained Flips in Plane Spanning Trees. 5:1-5:18 - Michael A. Bekos, Michael Kaufmann, Maximilian Pfister:
Approximating Barnette's Conjecture. 6:1-6:7 - Simon van Wageningen, Tamara Mchedlidze, Alexandru C. Telea:
Same Quality Metrics, Different Graph Drawings. 7:1-7:13 - Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis:
Tangling and Untangling Trees on Point-Sets. 8:1-8:18 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann:
The Page Number of Monotone Directed Acyclic Outerplanar Graphs Is Four or Five. 9:1-9:17 - Todor Antic, Vít Jelínek, Martin Pergel, Felix Schröder, Peter Stumpf, Pavel Valtr:
The Bend Number of Cocomparability Graphs. 10:1-10:23 - Lin Zhang, Yao Wang, Ying Zhang, Wilhelm Kerle-Malcharek, Karsten Klein, Falk Schreiber, Andreas Bulling:
Towards a Better Understanding of Graph Perception in Immersive Environments. 11:1-11:19 - Oswin Aichholzer, Sofia Brenner, Joseph Dorfer, Hung P. Hoang, Daniel Perz, Christian Rieck, Francesco Verciani:
Flipping Odd Matchings in Geometric and Combinatorial Settings. 12:1-12:18 - Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Separability of Witness Gabriel Drawings. 13:1-13:18 - Sergey Pupyrev:
OOPS: Optimized One-Planarity Solver via SAT. 14:1-14:19 - Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt:
Crossing Number of Simple 3-Plane Drawings. 15:1-15:19 - Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada:
Structural Parameterizations of k-Planarity. 16:1-16:17 - Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg:
Visualizing Treewidth. 17:1-17:20 - Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Giuseppe Liotta, Antonios Symvonis:
Internally-Convex Drawings of Outerplanar Graphs in Small Area. 18:1-18:17 - Todor Antic, Martin Balko, Birgit Vogtenhuber:
Crossing and Non-Crossing Families. 19:1-19:15 - Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. 20:1-20:32 - Parinya Chalermsook, Ly Orgo, Minoo Zarsav:
On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers. 21:1-21:24 - Ilan Hartskeerl, Tamara Mchedlidze, Simon van Wageningen, Peter Vangorp, Alexandru C. Telea:
NNP-NET: Accelerating t-SNE Graph Drawing for Very Large Graphs by Neural Networks. 22:1-22:22 - Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt:
The Price of Connectivity Augmentation on Planar Graphs. 23:1-23:24 - Maria Chudnovsky, David Eppstein, David Fischer:
String Graph Obstacles of High Girth and of Bounded Degree. 24:1-24:18 - Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Characterizing and Recognizing Twistedness. 25:1-25:17 - Eliska Cervenková, Jan Kratochvíl:
1-Planar Unit Distance Graphs with More Edges Than Matchstick Graphs. 26:1-26:10 - Alexander Dobler, Maximilian Holzmüller, Martin Nöllenburg:
Geometry Matters in Planar Storyplans. 27:1-27:9 - Rafal Pyzik:
Treewidth of Outer k-Planar Graphs. 28:1-28:16 - David Eppstein:
Stabbing Faces by a Convex Curve. 29:1-29:8 - Gavin J. Mooney, Tim Hegemann, Alexander Wolff, Michael Wybrow, Helen C. Purchase:
Universal Quality Metrics for Graph Drawings: Which Graphs Excite Us Most? 30:1-30:20 - Jacob Fox, János Pach, Andrew Suk:
From Local Pair-Crossing Number to Local Crossing Number. 31:1-31:6 - Carla Binucci, Sabine Cornelsen, Walter Didimo, Seok-Hee Hong, Eleni Katsanou, Maurizio Patrignani, Antonios Symvonis, Samuel Wolf:
Planar Stories of Graph Drawings: Algorithms and Experiments. 32:1-32:19 - Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber:
Edge Densities of Drawings of Graphs with One Forbidden Cell. 33:1-33:17 - Debajyoti Mondal:
Layered Polyline Drawings of Planar Graphs. 34:1-34:10 - Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista, Fabrizio Grosso, Maurizio Patrignani, Allegra Strippoli:
A Walk on the Wild Side: A Shape-First Methodology for Orthogonal Drawings. 35:1-35:20 - Florestan Brunck, Hsien-Chih Chang, Maarten Löffler, Tim Ophelders, Lena Schlipf:
Reconfiguration in Curve Arrangements to Reduce Self-Intersections and Popular Faces. 36:1-36:18 - Lucas Joos, Gavin J. Mooney, Maximilian T. Fischer, Daniel A. Keim, Falk Schreiber, Helen C. Purchase, Karsten Klein:
Show Me Your Best Side: Characteristics of User-Preferred Perspectives for 3D Graph Drawings. 37:1-37:19 - Gavin J. Mooney, Jacob Miller, Michael Wybrow, Stephen G. Kobourov, Helen C. Purchase:
Stress in Graph Drawings: Perception, Preference, and Performance. 38:1-38:23 - Alexander Dobler, Tim Hegemann, Martin Nöllenburg, Alexander Wolff:
Optimizing Wiggle in Storylines. 39:1-39:17 - Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis, Thanos Tolias:
An Algorithm for Accurate and Simple-Looking Metaphorical Maps. 40:1-40:17 - Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms:
Graph Drawing Contest Report (Graph Drawing Contest Report). 41:1-41:11 - Florian Sass, Jakob Speitkamp, Guilherme Monteiro Oliveira:
Journey of a Time Machine (Graph Drawing Contest Abstract). 42:1-42:2 - Julien Bianchetti, Laurent Moalic:
Winning the GD Challenge for the 4th Time: Our Approach (Graph Drawing Contest Abstract). 43:1-43:4 - Maarten Löffler, Frank Staals, Soeren Terziadis:
Recovering Graphs from Their Witness Unit Square Representation (Poster Abstract). 44:1-44:4 - Cristiano Bernardini, Davide Campanelli, Walter Didimo, Luca Grilli, Giuseppe Liotta, Benedetto Ponti:
TReView: Visualizing the European Union Transparency Register (Poster Abstract). 45:1-45:5 - Erin W. Chambers, Tim Ophelders, Anna Schenfisch, Julia Sollberger:
Counting Triangulations of Fixed Cardinal Degrees (Poster Abstract). 46:1-46:4 - Todor Antic, Guillermo Gamboa Quintero, Jelena Glisic:
Reconfigurations of Plane Caterpillars and Paths (Poster Abstract). 47:1-47:5 - Henry Förster, Stephen G. Kobourov, Jacob Miller, Johannes Zink:
Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid (Poster Abstract). 48:1-48:4 - Michael A. Bekos, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Luca Grilli, Maria Eleni Pavlidi, Alessandra Tappini, Alexandra Weinberger:
Defective Linear Layouts of Graphs (Poster Abstract). 49:1-49:4 - Maarten Löffler, Miriam Münch, Ignaz Rutter:
Reeb Lobsters Are 1-Planar (Poster Abstract). 50:1-50:5 - Oswin Aichholzer, Robert Ganian, Phillip Keldenich, Maarten Löffler, Gert G. T. Meijer, Alexandra Weinberger, Carola Wenk:
Graph Tiles (Poster Abstract). 51:1-51:5 - Ying Zhang, Niklas Gröne, Giuseppe Liotta, Falk Schreiber, Karsten Klein:
Investigating Crossing Perception in 3D Graph Visualisation (Poster Abstract). 52:1-52:5 - Raissa dos Santos Vieira, Hugo A. D. do Nascimento, Joelma de Moura Ferreira, Les R. Foulds, Karsten Klein, Falk Schreiber:
Edge Bundling as a Multi-Objective Optimization Problem (Poster Abstract). 53:1-53:5 - Amyra Meidiana, Seok-Hee Hong, Kwan-Liu Ma:
BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing (Poster Abstract). 54:1-54:5 - Lucas Joos, Maximilian T. Fischer, Alexander Frings, Daniel A. Keim:
EnMRgy: Energy Network Analysis in Mixed Reality (Poster Abstract). 55:1-55:5 - Timo Brand, Henry Förster, Stephen G. Kobourov, Robin Schukrafft, Markus Wallinger, Johannes Zink:
Using Reinforcement Learning to Optimize the Global and Local Crossing Number (Poster Abstract). 56:1-56:4
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
