Graph Drawing and Network Visualization, 1st ed. 2021 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers Information Systems and Applications, incl. Internet/Web, and HCI Series

The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report.

Best Paper (Track 1: Combinatorial and Algorithmic Aspects).- Edge-Minimum Saturated $k$-Planar Drawings.- Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects).- A User Study on Hybrid Graph Visualizations- Crossing Minimization and Beyond-Planarity Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics.- Simplifying Non-Simple Fan-Planar Drawings.- RAC-drawability is ER-complete.- Recognizing and Embedding Simple Optimal 2-Planar Graphs.- A short proof of the non-biplanarity of K 9.- Morphing and Graph Abstraction.- From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs.- Planar and Toroidal Morphs Made Easier.- Visualizing JIT Compiler Graphs.- Geometric Constraints.- Upward Planar Drawings with Three and More Slopes.- Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths.- One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.- Topological and Upward Drawings.- Quasi-upward Planar Drawings with Minimum Curve Complexity.- Non-homotopic Loops with a Bounded Number of Pairwise Intersections.- On the number of edges of separated multigraphs.- Linear Layouts.- On the Queue-Number of Partial Orders.- On the Upward Book Thickness Problem: Combinatorial and Complexity Results.- Linear Layouts of Complete Graphs.- On the Queue Number of Planar Graphs.- Contact and Visibility Representations.- Optimal-area visibility representations of outer-1-plane graphs.- Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs.- Layered Area-Proportional Rectangle Contact Representation.- Geometric Aspects in Graph Drawing.- Arrangements of orthogonal circles with many intersections.- Limitations on Realistic Hyperbolic Graph Drawing.- Embedding Ray Intersection Graphs and Global Curve Simplification.- AI Applications.- Drawing Networks with Deep Neural Network, (DNN)².- Implementation of Sprouts: a graph drawing game.- Graph Drawing Contest Report.