default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th GD 2021: Tübingen, Germany
- Helen C. Purchase
, Ignaz Rutter:
Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12868, Springer 2021, ISBN 978-3-030-92931-2 - Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. 3-17 - Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. 21-38 - Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. 41-56 - Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-simple Fan-Planar Drawings. 57-71 - Marcus Schaefer:
RAC-Drawability is ∃ ℝ-Complete. 72-86 - Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. 87-100 - Ahmad Biniaz:
A Short Proof of the Non-biplanarity of $$K_9$$. 101-106 - Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs. 109-122 - Jeff Erickson, Patrick Lin:
Planar and Toroidal Morphs Made Easier. 123-137 - HeuiChan Lim, Stephen G. Kobourov:
Visualizing JIT Compiler Graphs. 138-146 - Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. 149-165 - Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. 166-183 - Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. 184-192 - Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. 195-209 - Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. 210-222 - Jacob Fox, János Pach, Andrew Suk:
On the Number of Edges of Separated Multigraphs. 223-227 - Stefan Felsner, Torsten Ueckerdt, Kaja Wille:
On the Queue-Number of Partial Orders. 231-241 - Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. 242-256 - Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. 257-270 - Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
On the Queue Number of Planar Graphs. 271-284 - Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. 287-303 - Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg:
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. 304-317 - Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. 318-326 - Sarah Carmesin, André Schulz:
Arrangements of Orthogonal Circles with Many Intersections. 329-342 - David Eppstein:
Limitations on Realistic Hyperbolic Graph Drawing. 343-357 - Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler:
Embedding Ray Intersection Graphs and Global Curve Simplification. 358-371 - Loann Giovannangeli, Frédéric Lalanne, David Auber, Romain Giot, Romain Bourqui:
Deep Neural Network for DrawiNg Networks, $${(DNN)^{\textit{2}\, }} $$. 375-390 - Tomás Cízek, Martin Balko:
Implementation of Sprouts: A Graph Drawing Game. 391-405 - Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. 409-417
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-11-04 22:07 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:
