default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd GD 2024: Vienna, Austria
- Stefan Felsner
, Karsten Klein:
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria. LIPIcs 320, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-343-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Otfried Cheong:
How Can Biclique Covers Help in Matching Problems (Invited Talk). 1:1-1:1 - Monika Henzinger:
How Can Algorithms Help in Protecting Our Privacy (Invited Talk). 2:1-2:1 - Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
The Euclidean MST-Ratio for Bi-Colored Lattices. 3:1-3:23 - Jacob Fox, János Pach, Andrew Suk:
Enumeration of Intersection Graphs of x-Monotone Curves. 4:1-4:12 - Helena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder:
Holes in Convex and Simple Drawings. 5:1-5:9 - Panna Gehér, Géza Tóth:
1-Planar Unit Distance Graphs. 6:1-6:9 - Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. 7:1-7:17 - Petr Hlinený, Csenge Lili Ködmön:
Note on Min- k-Planar Drawings of Graphs. 8:1-8:10 - Adrian Dumitrescu, János Pach:
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. 9:1-9:10 - Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter:
Constrained Outer-String Representations. 10:1-10:18 - Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with Few Biarcs. 11:1-11:16 - Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity Of Extending Stack Layouts. 12:1-12:17 - Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. 13:1-13:20 - Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff:
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. 14:1-14:17 - Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger:
Bundling-Aware Graph Drawing. 15:1-15:19 - Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber:
GraphTrials: Visual Proofs of Graph Properties. 16:1-16:18 - Amyra Meidiana, Seok-Hee Hong, Yongcheng Jing:
Connectivity-Faithful Graph Drawing. 17:1-17:17 - Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner:
On the Uncrossed Number of Graphs. 18:1-18:13 - Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. 19:1-19:19 - Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Algorithms for One-Sided Crossing Minimization. 20:1-20:9 - Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, Jacob Miller:
The Perception of Stress in Graph Drawings. 21:1-21:17 - Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
Boundary Labeling in a Circular Orbit. 22:1-22:17 - Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt:
Intersection Graphs with and Without Product Structure. 23:1-23:19 - Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. 24:1-24:18 - Miriam Münch, Ignaz Rutter:
Parameterized Algorithms for Beyond-Planar Crossing Numbers. 25:1-25:16 - Tim Hegemann, Alexander Wolff:
Storylines with a Protagonist. 26:1-26:22 - Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. 27:1-27:17 - Aaron Büngener, Maximilian Pfister:
On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs. 28:1-28:21 - Aaron Büngener, Michael Kaufmann:
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs. 29:1-29:22 - Rohan Acharya, Torsten Mütze, Francesco Verciani:
Flips in Colorful Triangulations. 30:1-30:20 - Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. 31:1-31:19 - Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani:
On the Complexity of Recognizing k^+-Real Face Graphs. 32:1-32:22 - Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, Mirko H. Wagner:
Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach. 33:1-33:17 - Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber:
Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles. 34:1-34:17 - Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. 35:1-35:11 - Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. 36:1-36:17 - Vida Dujmovic, Camille La Rose:
Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor. 37:1-37:18 - Daniel J. Chang, Timothy Sun:
Harborth's Conjecture for 4-Regular Planar Graphs. 38:1-38:9 - David Eppstein, Michael T. Goodrich, Abraham M. Illickan:
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. 39:1-39:17 - Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. 40:1-40:16 - Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms:
Graph Drawing Contest Report (Graph Drawing Contest Report). 41:1-41:13 - Joshua Geis, Johannes Zink:
From Planar via Outerplanar to Outerpath - Engineering NP-Hardness Constructions (Poster Abstract). 42:1-42:3 - Robert Ganian, Martin Nöllenburg, Sebastian Röder:
Minimizing Switches in Cased Graph Drawings (Poster Abstract). 43:1-43:3 - Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, Maarten van Zalk:
Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract). 44:1-44:3 - Martin Nöllenburg, Sebastian Röder, Markus Wallinger:
GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). 45:1-45:3 - Nikolaus-Mathias Herl, Velitchko Andreev Filipov:
AdMaTilE: Visualizing Event-Based Adjacency Matrices in a Multiple-Coordinated-Views System (Poster Abstract). 46:1-46:3 - Maarten Löffler:
Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area (Poster Abstract). 47:1-47:3 - Sören Domrös, Reinhard von Hanxleden:
Determining Sugiyama Topology with Model Order (Poster Abstract). 48:1-48:3 - Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization (Poster Abstract). 49:1-49:3 - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf:
Level Planarity Is More Difficult Than We Thought (Poster Abstract). 50:1-50:3 - Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract). 51:1-51:3 - Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich:
Polygonally Anchored Graph Drawing (Poster Abstract). 52:1-52:3 - Stephane Durocher, Myroslav Kryven, Maarten Löffler:
String Graph with Cop Number 4 (Poster Abstract). 53:1-53:3 - Oriol Andreu Solé-Pi:
Approximating the Crossing Number of Dense Graphs (Poster Abstract). 54:1-54:3 - Evmorfia N. Argyriou, Benjamin Niedermann:
yFiles - From Data to Meaningful Visualizations (Software Abstract). 55:1-55:3 - Maximilian Kasperowski, Sören Domrös, Reinhard von Hanxleden:
The Eclipse Layout Kernel (Software Abstract). 56:1-56:2 - Stefan P. Feyer, Wilhelm Kerle-Malcharek, Ying Zhang, Falk Schreiber, Karsten Klein:
Immersive Analytics of Graphs in Virtual Reality with GAV-VR (Software Abstract). 57:1-57:3 - Julius Deynet, Tim Hegemann, Sebastian Kempf, Alexander Wolff:
Graph Harvester (Software Abstract). 58:1-58:3 - Garima Jindal, Kamalakar Karlapalem:
CentralityViz: Comprehending Node-Centrality in Large Networks (Software Abstract). 59:1-59:3 - Harald Meier, Arber Ceni:
NodeXL - A few Clicks to Network Insights (Software Abstract). 60:1-60:2 - Andreas Benno Kollegger, Alexander Erdl, Michael Hunger:
Knowledge Graph Builder - Constructing a Graph from Arbitrary Text Using an LLM (Software Abstract). 61:1-61:2
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 2024-11-14 20:48 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:
