JGAA Volumes Volume 26, no. 1, 2022 The Complexity of Poset Games Vol. 26, no. 1, pp. 1-14, 2022. Regular paper. Visibility Graphs of Anchor Polygons Hossein Boomari and Alireza Zarei Vol. 26, no. 1, pp. 15-34, 2022. Regular paper. The Degenerate Crossing Number and Higher-Genus Embeddings Vol. 26, no. 1, pp. 35-58, 2022. Regular paper. Drawing outer-1-planar graphs revisited Vol. 26, no. 1, pp. 59-73, 2022. Regular paper. A short proof of the non-biplanarity of $K_9$ Vol. 26, no. 1, pp. 75-80, 2022. Regular paper. Non-binary universal tree-based networks Mareike Fischer, Michelle Galla, and Kristina Wicke Vol. 26, no. 1, pp. 81-90, 2022. Regular paper. On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs Vahan Mkrtchyan and Garik Petrosyan Vol. 26, no. 1, pp. 91-110, 2022. Regular paper. Properties of Large 2-Crossing-Critical Graphs Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, and Tilo Wiedera Vol. 26, no. 1, pp. 111-147, 2022. Regular paper. Crossing Numbers of Beyond-Planar Graphs Revisited Nathan van Beusekom, Irene Parada, and Bettina Speckmann Vol. 26, no. 1, pp. 149-170, 2022. Regular paper. Upward planar drawings with two slopes Jonathan Klawitter and Tamara Mchedlidze Vol. 26, no. 1, pp. 171-198, 2022. Regular paper. A faster algorithm for maximum independent set on interval filament graphs Vol. 26, no. 1, pp. 199-205, 2022. Concise paper. Volume 26, no. 2, 2022 Special Issue on Selected Papers from the 15th International Conference and Workshops on Algorithms and Computation, WALCOM 2021 Guest Editor(s): Seok-Hee Hong, Subhas C. Nandy, and Ryuhei Uehara Guest Editors’ Foreword Seok-Hee Hong, Subhas C. Nandy, and Ryuhei Uehara Vol. 26, no. 2, pp. 207-208, 2022. Regular paper. Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs Vol. 26, no. 2, pp. 209-224, 2022. Regular paper. On Compatible Matchings Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber Vol. 26, no. 2, pp. 225-240, 2022. Regular paper. Computing L(p,1)-Labeling with Combined Parameters Tesshu Hanaka, Kazuma Kawai, and Hirotaka Ono Vol. 26, no. 2, pp. 241-255, 2022. Regular paper. An Improvement of Reed’s Treewidth Approximation Vol. 26, no. 2, pp. 257-282, 2022. Regular paper. Volume 26, no. 3, 2022 "Special issue on Selected papers from the Twenty-eighth International Symposium on Graph Drawing and Network Visualization, GD 2020" Guest Editor(s): David Auber and Pavel Valtr Editor in Chief's Foreword Giuseppe Liotta Vol. 26, no. 3, pp. 283-284, 2022. Regular paper. On Turn-Regular Orthogonal Representations Vol. 26, no. 3, pp. 285-306, 2022. Regular paper. Planar L-Drawings of Bimodal Graphs Vol. 26, no. 3, pp. 307-334, 2022. Regular paper. Parameterized Algorithms for Queue Layouts Vol. 26, no. 3, pp. 335-352, 2022. Regular paper. Drawing Shortest Paths in Geodetic Graphs Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, and Thomas Schneck Vol. 26, no. 3, pp. 353-361, 2022. Regular paper. Polygons with Prescribed Angles in 2D and 3D Vol. 26, no. 3, pp. 363-380, 2022. Regular paper. On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens Vol. 26, no. 3, pp. 381-399, 2022. Regular paper. Volume 26, no. 4, 2022 Parameterized Complexity of Geodetic Set Vol. 26, no. 4, pp. 401-419, 2022. Regular paper. The Complexity of Drawing a Graph in a Polygonal Region Anna Lubiw, Tillmann Miltzow, and Debajyoti Mondal Vol. 26, no. 4, pp. 421-446, 2022. Regular paper.