JGAA Volumes Volume 23, no. 1, 2019 Special Issue on Selected Papers from the 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 Guest Editor(s): Md. Saidur S. Rahman, Hsu-Chun Yen, and Sheung-Hung Poon Guest Editors' Foreword Vol. 23, no. 1, pp. 1-2, 2019. Sequentially Swapping Colored Tokens on Graphs Vol. 23, no. 1, pp. 3-27, 2019. Regular paper. The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant Vol. 23, no. 1, pp. 29-70, 2019. Regular paper. An Experimental Study on the Ply Number of Straight-line Drawings Vol. 23, no. 1, pp. 71-91, 2019. Regular paper. Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems Yuko Kuroki and Tomomi Matsui Vol. 23, no. 1, pp. 93-110, 2019. Regular paper. Volume 23, no. 2, 2019 How Bad is the Freedom to Flood-It? Vol. 23, no. 2, pp. 111-134, 2019. Regular paper. An effective crossing minimisation heuristic based on star insertion Vol. 23, no. 2, pp. 135-166, 2019. Regular paper. Finding a Maximum-Weight Convex Set in a Chordal Graph Jean Cardinal, Jean-Paul Doignon, and Keno Merckx Vol. 23, no. 2, pp. 167-190, 2019. Regular paper. Time Windowed Data Structures for Graphs Farah Chanchary and Anil Maheshwari Vol. 23, no. 2, pp. 191-226, 2019. Regular paper. Short certificates for chromatic equivalence Zoe Bukovac, Graham Farr, and Kerri Morgan Vol. 23, no. 2, pp. 227-269, 2019. Regular paper. Covering a Graph with Clubs Vol. 23, no. 2, pp. 271-292, 2019. Regular paper. Constructing Hard Examples for Graph Isomorphism Vol. 23, no. 2, pp. 293-316, 2019. Regular paper. Computation in Causal Graphs Vol. 23, no. 2, pp. 317-344, 2019. Regular paper. Construction and Local Routing for Angle-Monotone Graphs Vol. 23, no. 2, pp. 345-369, 2019. Regular paper. Drawing Graphs on Few Circles and Few Spheres Vol. 23, no. 2, pp. 371-391, 2019. Regular paper. Fast approximation of eccentricities and distances in hyperbolic graphs Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, and Hend Alrasheed Vol. 23, no. 2, pp. 393-433, 2019. Regular paper. COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, and Hiroshi Nagamochi Vol. 23, no. 2, pp. 434-458, 2019. Regular paper. Volume 23, no. 3, 2019 Special issue on Selected papers from the Twenty-sixth International Symposium on Graph Drawing and Network Visualization, GD 2018 Guest Editor(s): Therese Biedl and Andreas Kerren Guest Editors' Foreword Therese Biedl and Andreas Kerren Vol. 23, no. 3, pp. 459-461, 2019. Short Plane Supports for Spatial Hypergraphs Vol. 23, no. 3, pp. 463-498, 2019. Regular paper. A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width Vol. 23, no. 3, pp. 499-524, 2019. Regular paper. Aesthetic Discrimination of Graph Layouts Vol. 23, no. 3, pp. 525-552, 2019. Regular paper. A New Framework for Hierarchical Drawings Giacomo Ortali and Ioannis G. Tollis Vol. 23, no. 3, pp. 553-578, 2019. Regular paper. Pole Dancing: 3D Morphs for Tree Drawings Vol. 23, no. 3, pp. 579-602, 2019. Regular paper. Volume 23, no. 4, 2019 Geometry and Generation of a New Graph Planarity Game Rutger Kraaijer, Marc van Kreveld, Wouter Meulemans, and André van Renssen Vol. 23, no. 4, pp. 603-624, 2019. Regular paper. Density decompositions of networks Glencora Borradaile, Theresa Migler, and Gordon Wilfong Vol. 23, no. 4, pp. 625-651, 2019. Regular paper. How to Draw a Planarization Vol. 23, no. 4, pp. 653-682, 2019. Regular paper. Simultaneous Embeddings with Few Bends and Crossings Vol. 23, no. 4, pp. 683-713, 2019. Regular paper. Treewidth of display graphs: bounds, brambles and applications Vol. 23, no. 4, pp. 715-743, 2019. Regular paper. Homothetic triangle representations of planar graphs Vol. 23, no. 4, pp. 745-753, 2019. Concise paper. Volume 23, no. 5, 2019 Special Issue on Selected Papers from the 12th International Conference and Workshops on Algorithms and Computation, WALCOM 2018 Guest Editor(s): M. Sohel Rahman, Wing-Kin Sung, and Ryuhei Uehara Guest Editors' Foreword M. Sohel Rahman, Wing-Kin Sung, and Ryuhei Uehara Vol. 23, no. 5, pp. 755-757, 2019. Approximating Partially Bounded Degree Deletion on Directed Graphs Vol. 23, no. 5, pp. 759-780, 2019. Regular paper. Faster algorithms for shortest path and network flow based on graph decomposition Manas Jyoti Kashyop, Tsunehiko Nagayama, and Kunihiko Sadakane Vol. 23, no. 5, pp. 781-813, 2019. Regular paper. Random Popular Matchings with Incomplete Preference Lists Suthee Ruangwises and Toshiya Itoh Vol. 23, no. 5, pp. 815-835, 2019. Regular paper. A Simple Algorithm for $r$-gatherings on the Line Vol. 23, no. 5, pp. 837-845, 2019. Regular paper.