JGAA Volumes Volume 25, no. 1, 2021 Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles Vol. 25, no. 1, pp. 1-28, 2021. Regular paper. Complexity of Geometric k-Planarity for Fixed k Marcus Schaefer Vol. 25, no. 1, pp. 29-41, 2021. Regular paper. Two Results on Layered Pathwidth and Linear Layouts Vol. 25, no. 1, pp. 43-57, 2021. Regular paper. Minimal Embedding Dimensions of Rectangle k-Visibility Graphs Vol. 25, no. 1, pp. 59-96, 2021. Regular paper. Equilateral Spherical Drawings of Planar Cayley Graphs Vol. 25, no. 1, pp. 97-119, 2021. Regular paper. Circumference of essentially 4-connected planar triangulations Vol. 25, no. 1, pp. 121-132, 2021. Regular paper. On the Balance of Unrooted Trees Mareike Fischer and Volkmar Liebscher Vol. 25, no. 1, pp. 133-150, 2021. Regular paper. Multilevel Planarity Vol. 25, no. 1, pp. 151-170, 2021. Regular paper. On Area-Universal Quadrangulations Vol. 25, no. 1, pp. 171-193, 2021. Regular paper. On the Complexity of Some Geometric Problems With Fixed Parameters Vol. 25, no. 1, pp. 195-218, 2021. Regular paper. Fast Generation of Unlabelled Free Trees using Weight Sequences Paul Brown and Trevor Fenner Vol. 25, no. 1, pp. 219-240, 2021. Regular paper. Algebraic Algorithms for Betweenness and Percolation Centrality Vol. 25, no. 1, pp. 241-261, 2021. Regular paper. Heading in the right direction? Using head moves to traverse phylogenetic network space Remie Janssen Vol. 25, no. 1, pp. 263-310, 2021. Regular paper. Schematic Representation of Large Biconnected Graphs Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Marco Tais Vol. 25, no. 1, pp. 311-352, 2021. Regular paper. Radial Level Planarity with Fixed Embedding Vol. 25, no. 1, pp. 353-366, 2021. Regular paper. An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength A. Arul Shantrinal, Sandi Klavžar, T.M. Rajalaxmi, and R. Sundara Rajan Vol. 25, no. 1, pp. 367-381, 2021. Regular paper. The number of crossings in multigraphs with no empty lens Vol. 25, no. 1, pp. 383-396, 2021. Regular paper. Least resolved trees for two-colored best match graphs Vol. 25, no. 1, pp. 397-416, 2021. Regular paper. Tree Containment With Soft Polytomies Vol. 25, no. 1, pp. 417-436, 2021. Regular paper. Synchronized Traveling Salesman Problem Gyula Pap and József Varnyú Vol. 25, no. 1, pp. 437-459, 2021. Regular paper. Decycling bipartite graphs Vol. 25, no. 1, pp. 461-480, 2021. Regular paper. On Strict (Outer-)Confluent Graphs Vol. 25, no. 1, pp. 481-512, 2021. Regular paper. Revising the Fellows-Kaschube $K_{3,3}$ Search Vol. 25, no. 1, pp. 513-520, 2021. Concise paper. On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, and Rolf Niedermeier Vol. 25, no. 1, pp. 521-547, 2021. Regular paper.