Home Issues About JGAA Instructions for Authors
 
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
DOI: 10.7155/jgaa.00404
Guest Editors' Foreword
Vol. 21, no. 1, pp. 1-3, 2017.
DOI: 10.7155/jgaa.00399
OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs
Vol. 21, no. 1, pp. 5-27, 2017. Regular paper.
DOI: 10.7155/jgaa.00405
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.
DOI: 10.7155/jgaa.00406
An Incremental Layout Method for Visualizing Online Dynamic Graphs
Vol. 21, no. 1, pp. 55-80, 2017. Regular paper.
DOI: 10.7155/jgaa.00398
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
Vol. 21, no. 1, pp. 81-102, 2017. Regular paper.
DOI: 10.7155/jgaa.00402
Rook-drawings of Plane Graphs
Vol. 21, no. 1, pp. 103-120, 2017. Regular paper.
DOI: 10.7155/jgaa.00407
The Utility of Untangling
Vida Dujmović
Vol. 21, no. 1, pp. 121-134, 2017. Regular paper.
DOI: 10.7155/jgaa.00408
Hanani-Tutte for Radial Planarity
Vol. 21, no. 1, pp. 135-154, 2017. Regular paper.
Volume 21, no. 2, 2017
DOI: 10.7155/jgaa.00409
Star-Shaped and L-Shaped Orthogonal Drawings
Xin He and Dayu He
Vol. 21, no. 2, pp. 155-175, 2017. Regular paper.
DOI: 10.7155/jgaa.00410
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
Vol. 21, no. 2, pp. 177-181, 2017. Concise paper.
DOI: 10.7155/jgaa.00411
On the Complexity of the Planar Slope Number Problem
Vol. 21, no. 2, pp. 183-193, 2017. Concise paper.
DOI: 10.7155/jgaa.00412
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.
DOI: 10.7155/jgaa.00413
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
DOI: 10.7155/jgaa.00414
Guest Editors' Foreword
Mohammed Kaykobad and Rossella Petreschi
Vol. 21, no. 3, pp. 245-246, 2017.
DOI: 10.7155/jgaa.00415
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
Vol. 21, no. 3, pp. 247-263, 2017. Regular paper.
DOI: 10.7155/jgaa.00416
Generalized Bounded Tree Cover of a Graph
Vol. 21, no. 3, pp. 265-280, 2017. Regular paper.
DOI: 10.7155/jgaa.00417
On Aligned Bar 1-Visibility Graphs
Franz J. Brandenburg, Alexander Esch, and Daniel Neuwirth
Vol. 21, no. 3, pp. 281-312, 2017. Regular paper.
DOI: 10.7155/jgaa.00418
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.
DOI: 10.7155/jgaa.00419
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
Vol. 21, no. 3, pp. 341-352, 2017. Regular paper.
DOI: 10.7155/jgaa.00420
Hamiltonian chromatic number of block graphs
Devsi Bantva
Vol. 21, no. 3, pp. 353-369, 2017. Regular paper.
DOI: 10.7155/jgaa.00421
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
DOI: 10.7155/jgaa.00422
Essential Constraints of Edge-Constrained Proximity Graphs
Vol. 21, no. 4, pp. 389-415, 2017. Regular paper.
DOI: 10.7155/jgaa.00423
Incremental Network Design with Minimum Spanning Trees
Vol. 21, no. 4, pp. 417-432, 2017. Regular paper.
DOI: 10.7155/jgaa.00424
Drawing Planar Graphs with Reduced Height
Vol. 21, no. 4, pp. 433-453, 2017. Regular paper.
DOI: 10.7155/jgaa.00425
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.
DOI: 10.7155/jgaa.00426
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.
DOI: 10.7155/jgaa.00427
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
Vol. 21, no. 4, pp. 527-546, 2017. Regular paper.
DOI: 10.7155/jgaa.00428
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.
DOI: 10.7155/jgaa.00429
A Note on the Existence of All (g,f)-Factors
Radosław Cymer
Vol. 21, no. 4, pp. 555-560, 2017. Concise paper.
DOI: 10.7155/jgaa.00430
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.
DOI: 10.7155/jgaa.00431
Topological Decomposition of Directed Graphs
Ala Abuthawabeh and Dirk Zeckzer
Vol. 21, no. 4, pp. 589-630, 2017. Regular paper.
DOI: 10.7155/jgaa.00432
Ideal Drawings of Rooted Trees With Approximately Optimal Width
Vol. 21, no. 4, pp. 631-648, 2017. Regular paper.
DOI: 10.7155/jgaa.00433
D-resolvability of vertices in planar graphs
James A. Tilley
Vol. 21, no. 4, pp. 649-661, 2017. Regular paper.
DOI: 10.7155/jgaa.00434
Rooted Cycle Bases
David Eppstein, J. Michael McCarthy, and Brian E. Parrish
Vol. 21, no. 4, pp. 663-686, 2017. Regular paper.
DOI: 10.7155/jgaa.00435
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.
DOI: 10.7155/jgaa.00436
On the Total Number of Bends for Planar Octilinear Drawings
Vol. 21, no. 4, pp. 709-730, 2017. Regular paper.
DOI: 10.7155/jgaa.00437
Intersection-Link Representations of Graphs
Vol. 21, no. 4, pp. 731-755, 2017. Regular paper.
DOI: 10.7155/jgaa.00438
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
DOI: 10.7155/jgaa.00439
Guest editors' foreword
Yifan Hu and Martin Nöllenburg
Vol. 21, no. 5, pp. 787-789, 2017.
DOI: 10.7155/jgaa.00440
A Sparse Stress Model
Mark Ortmann, Mirza Klimenta, and Ulrik Brandes
Vol. 21, no. 5, pp. 791-821, 2017. Regular paper.
DOI: 10.7155/jgaa.00441
Generalized Layerings for Arbitrary and Fixed Drawing Areas
Vol. 21, no. 5, pp. 823-856, 2017. Regular paper.
DOI: 10.7155/jgaa.00442
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.
DOI: 10.7155/jgaa.00443
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.
DOI: 10.7155/jgaa.00444
Non-aligned Drawings of Planar Graphs
Vol. 21, no. 5, pp. 915-937, 2017. Regular paper.
DOI: 10.7155/jgaa.00445
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
DOI: 10.7155/jgaa.00446
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.
DOI: 10.7155/jgaa.00447
Computing phylogenetic trees using topologically related minimum spanning trees
Vol. 21, no. 6, pp. 1003-1025, 2017. Regular paper.
DOI: 10.7155/jgaa.00448
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.
DOI: 10.7155/jgaa.00449
Parameterized and approximation complexity of the detection pair problem in graphs
Vol. 21, no. 6, pp. 1039-1056, 2017. Regular paper.
DOI: 10.7155/jgaa.00450
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Vol. 21, no. 6, pp. 1057-1089, 2017. Regular paper.
DOI: 10.7155/jgaa.00451
Equitable colorings of $K_4$-minor-free graphs
Vol. 21, no. 6, pp. 1091-1105, 2017. Regular paper.
DOI: 10.7155/jgaa.00452
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.