JGAA Volumes 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.