JGAA Volumes Volume 22, no. 1, 2018 Special Issue on Graph Drawing Beyond Planarity Guest Editor(s): Michael A. Bekos, Michael Kaufmann, and Fabrizio Montecchiani Guest Editors' Foreword and Overview Vol. 22, no. 1, pp. 1-10, 2018. On the size of planarly connected crossing graphs Eyal Ackerman, Balázs Keszegh, and Mate Vizer Vol. 22, no. 1, pp. 11-22, 2018. Regular paper. Parameterized Complexity of 1-Planarity Vol. 22, no. 1, pp. 23-49, 2018. Regular paper. A First Order Logic Definition of Beyond-Planar Graphs Franz J. Brandenburg Vol. 22, no. 1, pp. 51-66, 2018. Regular paper. On the Maximum Crossing Number Vol. 22, no. 1, pp. 67-87, 2018. Regular paper. Stack and Queue Layouts via Layered Separators Vol. 22, no. 1, pp. 89-99, 2018. Regular paper. On the NP-hardness of GRacSim drawing and k-SEFE Problems Luca Grilli Vol. 22, no. 1, pp. 101-116, 2018. Regular paper. Saturated simple and 2-simple topological graphs with few edges Péter Hajnal, Alexander Igamberdiev, Günter Rote, and André Schulz Vol. 22, no. 1, pp. 117-138, 2018. Regular paper. Volume 22, no. 2, 2018 Computing NodeTrix Representations of Clustered Graphs Vol. 22, no. 2, pp. 139-176, 2018. Regular paper. On Algorithms Employing Treewidth for $L$-bounded Cut Problems Petr Kolman Vol. 22, no. 2, pp. 177-191, 2018. Regular paper. Edge $k$-$q$-Colorability of Graphs Selma Djelloul, Odile Favaron, and Mekkia Kouider Vol. 22, no. 2, pp. 193-206, 2018. Regular paper. Data Structures and their Planar Graph Layouts Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, and Andreas Gleißner Vol. 22, no. 2, pp. 207-237, 2018. Regular paper. Recognizing IC-Planar and NIC-Planar Graphs Franz Brandenburg Vol. 22, no. 2, pp. 239-271, 2018. Regular paper. Intersection Graphs of Rays and Grounded Segments Vol. 22, no. 2, pp. 273-295, 2018. Regular paper. An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications Vol. 22, no. 2, pp. 297-327, 2018. Regular paper. The SNPR neighbourhood of tree-child networks Jonathan Klawitter Vol. 22, no. 2, pp. 329-355, 2018. Regular paper. Drawing Planar Graphs with Few Geometric Primitives Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, and André Schulz Vol. 22, no. 2, pp. 357-387, 2018. Regular paper. A Faster Algorithm for Maximum Induced Matchings on Circle Graphs Max Ward, Andrew Gozzard, Michael Wise, and Amitava Datta Vol. 22, no. 2, pp. 389-396, 2018. Concise paper. Volume 22, no. 3, 2018 Special issue on Selected papers from the Twenty-fifth International Symposium on Graph Drawing and Network Visualization, GD 2017 Guest Editor(s): Fabrizio Frati and Kwan-Liu Ma Guest editors' foreword Vol. 22, no. 3, pp. 397-399, 2018. Aligned Drawings of Planar Graphs Vol. 22, no. 3, pp. 401-429, 2018. Regular paper. Reconstructing Generalized Staircase Polygons with Uniform Step Length Vol. 22, no. 3, pp. 431-459, 2018. Regular paper. The Effect of Planarization on Width Vol. 22, no. 3, pp. 461-481, 2018. Regular paper. Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs Vol. 22, no. 3, pp. 483-499, 2018. Regular paper. Experimental Analysis of the Accessibility of Drawings with Few Segments Vol. 22, no. 3, pp. 501-518, 2018. Regular paper. Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies Vol. 22, no. 3, pp. 519-553, 2018. Regular paper. Volume 22, no. 4, 2018 Approximation Algorithms for Not Necessarily Disjoint Clustered TSP Nili Guttmann-Beck, Eyal Knaan, and Michal Stern Vol. 22, no. 4, pp. 555-575, 2018. Regular paper. Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth Michael J. Bannister and David Eppstein Vol. 22, no. 4, pp. 577-606, 2018. Regular paper. A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs Vol. 22, no. 4, pp. 607-616, 2018. Concise paper.