Home Issues About JGAA Instructions for Authors
 
JGAA Volumes
Volume 25, no. 1, 2021
DOI: 10.7155/jgaa.00547
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Vol. 25, no. 1, pp. 1-28, 2021. Regular paper.
DOI: 10.7155/jgaa.00548
Complexity of Geometric k-Planarity for Fixed k
Marcus Schaefer
Vol. 25, no. 1, pp. 29-41, 2021. Regular paper.
DOI: 10.7155/jgaa.00549
Two Results on Layered Pathwidth and Linear Layouts
Vol. 25, no. 1, pp. 43-57, 2021. Regular paper.
DOI: 10.7155/jgaa.00550
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs
Vol. 25, no. 1, pp. 59-96, 2021. Regular paper.
DOI: 10.7155/jgaa.00551
Equilateral Spherical Drawings of Planar Cayley Graphs
Vol. 25, no. 1, pp. 97-119, 2021. Regular paper.
DOI: 10.7155/jgaa.00552
Circumference of essentially 4-connected planar triangulations
Vol. 25, no. 1, pp. 121-132, 2021. Regular paper.
DOI: 10.7155/jgaa.00553
On the Balance of Unrooted Trees
Mareike Fischer and Volkmar Liebscher
Vol. 25, no. 1, pp. 133-150, 2021. Regular paper.
DOI: 10.7155/jgaa.00554
Multilevel Planarity
Vol. 25, no. 1, pp. 151-170, 2021. Regular paper.
DOI: 10.7155/jgaa.00555
On Area-Universal Quadrangulations
Vol. 25, no. 1, pp. 171-193, 2021. Regular paper.
DOI: 10.7155/jgaa.00557
On the Complexity of Some Geometric Problems With Fixed Parameters
Vol. 25, no. 1, pp. 195-218, 2021. Regular paper.
DOI: 10.7155/jgaa.00556
Fast Generation of Unlabelled Free Trees using Weight Sequences
Paul Brown and Trevor Fenner
Vol. 25, no. 1, pp. 219-240, 2021. Regular paper.
DOI: 10.7155/jgaa.00558
Algebraic Algorithms for Betweenness and Percolation Centrality
Vol. 25, no. 1, pp. 241-261, 2021. Regular paper.
DOI: 10.7155/jgaa.00559
Heading in the right direction? Using head moves to traverse phylogenetic network space
Remie Janssen
Vol. 25, no. 1, pp. 263-310, 2021. Regular paper.
DOI: 10.7155/jgaa.00560
Schematic Representation of Large Biconnected Graphs
Vol. 25, no. 1, pp. 311-352, 2021. Regular paper.
DOI: 10.7155/jgaa.00561
Radial Level Planarity with Fixed Embedding
Vol. 25, no. 1, pp. 353-366, 2021. Regular paper.
DOI: 10.7155/jgaa.00562
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
A. Arul Shantrinal, Sandi Klavžar, T.M. Rajalaxmi, and R. Sundara Rajan
Vol. 25, no. 1, pp. 367-381, 2021. Regular paper.
DOI: 10.7155/jgaa.00563
The number of crossings in multigraphs with no empty lens
Vol. 25, no. 1, pp. 383-396, 2021. Regular paper.
DOI: 10.7155/jgaa.00564
Least resolved trees for two-colored best match graphs
Vol. 25, no. 1, pp. 397-416, 2021. Regular paper.
DOI: 10.7155/jgaa.00565
Tree Containment With Soft Polytomies
Vol. 25, no. 1, pp. 417-436, 2021. Regular paper.
DOI: 10.7155/jgaa.00566
Synchronized Traveling Salesman Problem
Gyula Pap and József Varnyú
Vol. 25, no. 1, pp. 437-459, 2021. Regular paper.
DOI: 10.7155/jgaa.00567
Decycling bipartite graphs
Vol. 25, no. 1, pp. 461-480, 2021. Regular paper.
DOI: 10.7155/jgaa.00568
On Strict (Outer-)Confluent Graphs
Vol. 25, no. 1, pp. 481-512, 2021. Regular paper.
DOI: 10.7155/jgaa.00569
Revising the Fellows-Kaschube $K_{3,3}$ Search
Vol. 25, no. 1, pp. 513-520, 2021. Concise paper.
DOI: 10.7155/jgaa.00570
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, and Rolf Niedermeier
Vol. 25, no. 1, pp. 521-547, 2021. Regular paper.