JGAA Volumes Volume 21, no. 1, 2017 Special Issue on Selected papers from the Twenty-third International Symposium on Graph Drawing and Network Visualization, GD 2015 Guest Editor(s): Emilio Di Giacomo and Anna Lubiw Guest Editors' Foreword Vol. 21, no. 1, pp. 1-3, 2017. Regular paper. OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs Vol. 21, no. 1, pp. 5-27, 2017. Regular paper. Shape-Based Quality Metrics for Large Graph Visualization Peter Eades, Seok-Hee Hong, An Nguyen, and Karsten Klein Vol. 21, no. 1, pp. 29-53, 2017. Regular paper. An Incremental Layout Method for Visualizing Online Dynamic Graphs Vol. 21, no. 1, pp. 55-80, 2017. Regular paper. Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus Vol. 21, no. 1, pp. 81-102, 2017. Regular paper. Rook-drawings of Plane Graphs Vol. 21, no. 1, pp. 103-120, 2017. Regular paper. The Utility of Untangling Vida Dujmović Vol. 21, no. 1, pp. 121-134, 2017. Regular paper. Hanani-Tutte for Radial Planarity Vol. 21, no. 1, pp. 135-154, 2017. Regular paper. Volume 21, no. 2, 2017 Star-Shaped and L-Shaped Orthogonal Drawings Xin He and Dayu He Vol. 21, no. 2, pp. 155-175, 2017. Regular paper. On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem Vol. 21, no. 2, pp. 177-181, 2017. Concise paper. On the Complexity of the Planar Slope Number Problem Vol. 21, no. 2, pp. 183-193, 2017. Concise paper. Symmetry Breaking Constraints for the Minimum Deficiency Problem Sivan Altinakar, Gilles Caporossi, and Alain Hertz Vol. 21, no. 2, pp. 195-218, 2017. Regular paper. On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT Vol. 21, no. 2, pp. 219-243, 2017. Regular paper. Volume 21, no. 3, 2017 Special Issue on Selected Papers from the Tenth International Workshop on Algorithms and Computation (WALCOM 2016) Guest Editor(s): Mohammed Kaykobad and Rossella Petreschi Guest Editors' Foreword Mohammed Kaykobad and Rossella Petreschi Vol. 21, no. 3, pp. 245-246, 2017. Regular paper. Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi Vol. 21, no. 3, pp. 247-263, 2017. Regular paper. Generalized Bounded Tree Cover of a Graph Vol. 21, no. 3, pp. 265-280, 2017. Regular paper. On Aligned Bar 1-Visibility Graphs Franz J. Brandenburg, Alexander Esch, and Daniel Neuwirth Vol. 21, no. 3, pp. 281-312, 2017. Regular paper. Vertex-Coloring with Defects Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, and Antonios Symvonis Vol. 21, no. 3, pp. 313-340, 2017. Regular paper. A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs Vol. 21, no. 3, pp. 341-352, 2017. Regular paper. Hamiltonian chromatic number of block graphs Devsi Bantva Vol. 21, no. 3, pp. 353-369, 2017. Regular paper. Lower Bounds for Graph Exploration Using Local Policies Aditya Kumar Akash, Sándor Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, and James McLurkin Vol. 21, no. 3, pp. 371-387, 2017. Regular paper. Volume 21, no. 4, 2017 Essential Constraints of Edge-Constrained Proximity Graphs Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, and Michiel Smid Vol. 21, no. 4, pp. 389-415, 2017. Regular paper. Incremental Network Design with Minimum Spanning Trees Vol. 21, no. 4, pp. 417-432, 2017. Regular paper. Drawing Planar Graphs with Reduced Height Vol. 21, no. 4, pp. 433-453, 2017. Regular paper. Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory Vol. 21, no. 4, pp. 455-489, 2017. Regular paper. Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms Vol. 21, no. 4, pp. 491-525, 2017. Regular paper. Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, and Michiel Smid Vol. 21, no. 4, pp. 527-546, 2017. Regular paper. A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints Max Ward, Andrew Gozzard, and Amitava Datta Vol. 21, no. 4, pp. 547-554, 2017. Concise paper. A Note on the Existence of All (g,f)-Factors Radosław Cymer Vol. 21, no. 4, pp. 555-560, 2017. Concise paper. Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments Alexander Igamberdiev, Wouter Meulemans, and André Schulz Vol. 21, no. 4, pp. 561-588, 2017. Regular paper. Topological Decomposition of Directed Graphs Ala Abuthawabeh and Dirk Zeckzer Vol. 21, no. 4, pp. 589-630, 2017. Regular paper. Ideal Drawings of Rooted Trees With Approximately Optimal Width Vol. 21, no. 4, pp. 631-648, 2017. Regular paper. D-resolvability of vertices in planar graphs James A. Tilley Vol. 21, no. 4, pp. 649-661, 2017. Regular paper. Rooted Cycle Bases David Eppstein, J. Michael McCarthy, and Brian E. Parrish Vol. 21, no. 4, pp. 663-686, 2017. Regular paper. Egalitarian Graph Orientations Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon Wilfong, and Lisa Zhang Vol. 21, no. 4, pp. 687-708, 2017. Regular paper. On the Total Number of Bends for Planar Octilinear Drawings Vol. 21, no. 4, pp. 709-730, 2017. Regular paper. Intersection-Link Representations of Graphs Vol. 21, no. 4, pp. 731-755, 2017. Regular paper. Progress on Partial Edge Drawings Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Alexander Wolff Vol. 21, no. 4, pp. 757-786, 2017. Regular paper. Volume 21, no. 5, 2017 Special issue on Selected papers from the Twenty-fourth International Symposium on Graph Drawing and Network Visualization, GD 2016 Guest Editor(s): Yifan Hu and Martin Nöllenburg Guest editors' foreword Yifan Hu and Martin Nöllenburg Vol. 21, no. 5, pp. 787-789, 2017. Regular paper. A Sparse Stress Model Mark Ortmann, Mirza Klimenta, and Ulrik Brandes Vol. 21, no. 5, pp. 791-821, 2017. Regular paper. Generalized Layerings for Arbitrary and Fixed Drawing Areas Vol. 21, no. 5, pp. 823-856, 2017. Regular paper. Node Overlap Removal by Growing a Tree Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, and Alexander Holroyd Vol. 21, no. 5, pp. 857-872, 2017. Regular paper. Block Crossings in Storyline Visualizations Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, and Alexander Wolff Vol. 21, no. 5, pp. 873-913, 2017. Regular paper. Non-aligned Drawings of Planar Graphs Vol. 21, no. 5, pp. 915-937, 2017. Regular paper. A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková, and Martin Tancer Vol. 21, no. 5, pp. 939-981, 2017. Regular paper. Volume 21, no. 6, 2017 Column planarity and partially-simultaneous geometric embedding Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, and Bettina Speckmann Vol. 21, no. 6, pp. 983-1002, 2017. Regular paper. Computing phylogenetic trees using topologically related minimum spanning trees Vol. 21, no. 6, pp. 1003-1025, 2017. Regular paper. Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing Daniel Summer Magruder and Stefan Bonn Vol. 21, no. 6, pp. 1027-1038, 2017. Concise paper. Parameterized and approximation complexity of the detection pair problem in graphs Vol. 21, no. 6, pp. 1039-1056, 2017. Regular paper. Planarity of Overlapping Clusterings Including Unions of Two Partitions Vol. 21, no. 6, pp. 1057-1089, 2017. Regular paper. Equitable colorings of $K_4$-minor-free graphs Vol. 21, no. 6, pp. 1091-1105, 2017. Regular paper. Graphs with Obstacle Number Greater than One Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree, John Gimbel, Chris Hartman, and Gordon I. Williams Vol. 21, no. 6, pp. 1107-1119, 2017. Concise paper.