Home Issues About JGAA Instructions for Authors
 
JGAA Volumes
Volume 27, no. 1, 2023
DOI: 10.7155/jgaa.00607
The Minimum Moving Spanning Tree Problem
Vol. 27, no. 1, pp. 1-18, 2023. Regular paper.
DOI: 10.7155/jgaa.00611
Restricted rotation distance between k-ary trees
Vol. 27, no. 1, pp. 19-33, 2023. Regular paper.
DOI: 10.7155/jgaa.00612
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
Vol. 27, no. 1, pp. 35-44, 2023. Regular paper.
Volume 27, no. 2, 2023
Special issue on Selected papers from the Twenty-nineth International Symposium on Graph Drawing and Network Visualization, GD 2021 Guest Editor(s): Ignaz Rutter and Helene Purchase
DOI: 10.7155/jgaa.00613
Guest Editors’ Foreword
Ignaz Rutter and Helen C. Purchase
Vol. 27, no. 2, pp. 45-47, 2023. Regular paper.
DOI: 10.7155/jgaa.00614
Arrangements of orthogonal circles with many intersections
Sarah Carmesin and André Schulz
Vol. 27, no. 2, pp. 49-70, 2023. Regular paper.
DOI: 10.7155/jgaa.00617
Upward Planar Drawings with Three and More Slopes
Vol. 27, no. 2, pp. 49-70, 2023. Regular paper.
DOI: 10.7155/jgaa.00615
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Vol. 27, no. 2, pp. 71-94, 2023. Regular paper.
DOI: 10.7155/jgaa.00616
Planar and Toroidal Morphs Made Easier
Vol. 27, no. 2, pp. 95-118, 2023. Regular paper.
DOI: 10.7155/jgaa.00618
Simplifying Non-Simple Fan-Planar Drawings
Vol. 27, no. 2, pp. 147-172, 2023. Regular paper.
Volume 27, no. 3, 2023
DOI: 10.7155/jgaa.00619
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Maciej Rymar, Hendrik Molter, André Nichterlein, and Rolf Niedermeier
Vol. 27, no. 3, pp. 173-194, 2023. Regular paper.
DOI: 10.7155/jgaa.00620
Computing Betweenness Centrality in Link Streams
Frédéric Simard, Clémence Magnien, and Matthieu Latapy
Vol. 27, no. 3, pp. 195-217, 2023. Regular paper.
DOI: 10.7155/jgaa.00621
Improved (In-)Approximability Bounds for d-Scattered Set
Vol. 27, no. 3, pp. 219-238, 2023. Regular paper.
Volume 27, no. 4, 2023
Special Issue on Selected Papers from the 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 Guest Editor(s): Md. Saidur Rahman, Petra Mutzel, and Slamin
DOI: 10.7155/jgaa.00622
Guest Editors' forewords
Md. Saidur Rahman, Petra Mutzel, and - Slamin
Vol. 27, no. 4, pp. 239-240, 2023. Regular paper.
DOI: 10.7155/jgaa.00623
Morphing tree drawings in a small 3D grid
Elena Arseneva, Rahul Gangopadhyay, and Aleksandra Istomina
Vol. 27, no. 4, pp. 241-279, 2023. Regular paper.
DOI: 10.7155/jgaa.00624
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Rahnuma Islam Nishat, Venkatesh Srinivasan, and Sue Whitesides
Vol. 27, no. 4, pp. 281-327, 2023. Regular paper.
Volume 27, no. 5, 2023
DOI: 10.7155/jgaa.00625
Quasipolynomiality of the Smallest Missing Induced Subgraph
Vol. 27, no. 5, pp. 329-339, 2023. Regular paper.
DOI: 10.7155/jgaa.00626
Connected-closeness: A Visual Quantification of Distances in Network Layouts
Vol. 27, no. 5, pp. 341-404, 2023. Regular paper.
Volume 27, no. 6, 2023
Special Issue on Parameterized and Approximation Algorithms in Graph Drawing Guest Editor(s): Giordano Da Lozzo and Philipp Kindermann
DOI: 10.7155/jgaa.00627
Guest Editors' Foreword
Vol. 27, no. 6, pp. 405-408, 2023. Regular paper.
DOI: 10.7155/jgaa.00628
Order Reconfiguration under Width Constraints
Vol. 27, no. 6, pp. 409-431, 2023. Regular paper.
DOI: 10.7155/jgaa.00629
Approximating the Bundled Crossing Number
Alan Arroyo and Stefan Felsner
Vol. 27, no. 6, pp. 433-457, 2023. Regular paper.
DOI: 10.7155/jgaa.00630
The Complexity of Drawing Graphs on Few Lines and Few Planes
Vol. 27, no. 6, pp. 459-488, 2023. Regular paper.
DOI: 10.7155/jgaa.00631
Inserting Multiple Edges into a Planar Graph
Vol. 27, no. 6, pp. 489-522, 2023. Regular paper.
Volume 27, no. 7, 2023
DOI: 10.7155/jgaa.00632
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
Sabine Cornelsen and Gregor Diatzko
Vol. 27, no. 7, pp. 523-540, 2023. Regular paper.
DOI: 10.7155/jgaa.00633
Computing consensus networks for collections of 1-nested phylogenetic networks
Vol. 27, no. 7, pp. 541-563, 2023. Regular paper.
DOI: 10.7155/jgaa.00634
The Complexity of Angular Resolution
Vol. 27, no. 7, pp. 565-580, 2023. Regular paper.
DOI: 10.7155/jgaa.00635
A Heuristic for Direct Product Graph Decomposition
Vol. 27, no. 7, pp. 581-601, 2023. Regular paper.
DOI: 10.7155/jgaa.00636
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
Vol. 27, no. 7, pp. 603-619, 2023. Regular paper.
Volume 27, no. 8, 2023
Special issue on Selected papers from the Thirtieth International Symposium on Graph Drawing and Network Visualization, GD 2022 Guest Editor(s): Patrizio Angelini and Reinhard von Hanxleden
DOI: 10.7155/jgaa.00642
Guest Editors' Foreword
Vol. 27, no. 8, pp. 621-623, 2023. Regular paper.
DOI: 10.7155/jgaa.00638
$st$-Orientations with Few Transitive Edges
Vol. 27, no. 8, pp. 625-650, 2023. Regular paper.
DOI: 10.7155/jgaa.00639
Small Point-Sets Supporting Graph Stories
Vol. 27, no. 8, pp. 651-677, 2023. Regular paper.
DOI: 10.7155/jgaa.00640
Rectilinear Planarity of Partial 2-Trees
Vol. 27, no. 8, pp. 679-719, 2023. Regular paper.
DOI: 10.7155/jgaa.00637
Empty Triangles in Generalized Twisted Drawings of $K_n$
Vol. 27, no. 8, pp. 721-735, 2023. Regular paper.
DOI: 10.7155/jgaa.00641
Effective Computation of a Feedback Arc Set Using PageRank
Vol. 27, no. 8, pp. 737-757, 2023. Regular paper.
Volume 27, no. 9, 2023
DOI: 10.7155/jgaa.00643
The Computational Complexity of the ChordLink Model
Vol. 27, no. 9, pp. 759-767, 2023. Concise paper.
DOI: 10.7155/jgaa.00644
Minimum Linear Arrangement of Generalized Sierpinski Graphs
Vol. 27, no. 9, pp. 767-782, 2023. Regular paper.