| 2021 | A Short Proof of the Non-biplanarity of $$K_9$$. Ahmad Biniaz |
| 2021 | A User Study on Hybrid Graph Visualizations. Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini |
| 2021 | Arrangements of Orthogonal Circles with Many Intersections. Sarah Carmesin, André Schulz |
| 2021 | Deep Neural Network for DrawiNg Networks, $${(DNN)^{\textit{2}\, }} $$. Loann Giovannangeli, Frédéric Lalanne, David Auber, Romain Giot, Romain Bourqui |
| 2021 | Edge-Minimum Saturated k-Planar Drawings. Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt |
| 2021 | Embedding Ray Intersection Graphs and Global Curve Simplification. Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler |
| 2021 | From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs. Giuseppe Di Battista, Fabrizio Frati |
| 2021 | Graph Drawing Contest Report. Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans |
| 2021 | Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers Helen C. Purchase, Ignaz Rutter |
| 2021 | Implementation of Sprouts: A Graph Drawing Game. Tomás Cízek, Martin Balko |
| 2021 | Layered Area-Proportional Rectangle Contact Representations. Martin Nöllenburg, Anaïs Villedieu, Jules Wulms |
| 2021 | Limitations on Realistic Hyperbolic Graph Drawing. David Eppstein |
| 2021 | Linear Layouts of Complete Graphs. Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr |
| 2021 | Non-homotopic Loops with a Bounded Number of Pairwise Intersections. Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr |
| 2021 | On the Number of Edges of Separated Multigraphs. Jacob Fox, János Pach, Andrew Suk |
| 2021 | On the Queue Number of Planar Graphs. Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou |
| 2021 | On the Queue-Number of Partial Orders. Stefan Felsner, Torsten Ueckerdt, Kaja Wille |
| 2021 | On the Upward Book Thickness Problem: Combinatorial and Complexity Results. Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg |
| 2021 | One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis |
| 2021 | Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani |
| 2021 | Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani |
| 2021 | Planar and Toroidal Morphs Made Easier. Jeff Erickson, Patrick Lin |
| 2021 | Quasi-upward Planar Drawings with Minimum Curve Complexity. Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini |
| 2021 | RAC-Drawability is ∃ ℝ-Complete. Marcus Schaefer |
| 2021 | Recognizing and Embedding Simple Optimal 2-Planar Graphs. Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou |
| 2021 | Simplifying Non-simple Fan-Planar Drawings. Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder |
| 2021 | Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. Markus Chimani, Max Ilsen, Tilo Wiedera |
| 2021 | Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg |
| 2021 | Upward Planar Drawings with Three and More Slopes. Jonathan Klawitter, Johannes Zink |
| 2021 | Visualizing JIT Compiler Graphs. HeuiChan Lim, Stephen G. Kobourov |