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.