Home Issues About JGAA Instructions for Authors
 
Editor-in-Chief
G. Liotta
University of Perugia
giuseppe.liotta@unipg.it
Publication Editor
E. Di Giacomo
University of Perugia
emilio.digiacomo@unipg.it
Executive Committee
G. Liotta
University of Perugia
R. Tamassia
Brown University
I. G. Tollis
University of Crete
JGAA Indexing and Ranking

JGAA is indexed by Scopus. Below you can find the CiteScore and SJR metrics of JGAA. For details click on the images.

1.14
2018CiteScore
 
75th percentile
Powered by  Scopus
SCImago Journal & Country Rank

The Journal of Graph Algorithms and Applications (JGAA) is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards and is distributed in electronic form. JGAA is a diamond open access journal that charges no author fees.

View full aims and scope

News
June 2022. It is with great sadness that we have learned of the passing away on April, 2022 of Prof. Gerhard J. Woeginger who served in the JGAA editorial board for many years.
Recently Published
DOI: 10.7155/jgaa.00600
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens
Vol. 26, no. 3, pp. 381-399, 2022. Regular paper.
DOI: 10.7155/jgaa.00599
Polygons with Prescribed Angles in 2D and 3D
Vol. 26, no. 3, pp. 363-380, 2022. Regular paper.
DOI: 10.7155/jgaa.00598
Drawing Shortest Paths in Geodetic Graphs
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, and Thomas Schneck
Vol. 26, no. 3, pp. 353-361, 2022. Regular paper.
DOI: 10.7155/jgaa.00597
Parameterized Algorithms for Queue Layouts
Vol. 26, no. 3, pp. 335-352, 2022. Regular paper.
DOI: 10.7155/jgaa.00596
Planar L-Drawings of Bimodal Graphs
Vol. 26, no. 3, pp. 307-334, 2022. Regular paper.
DOI: 10.7155/jgaa.00595
On Turn-Regular Orthogonal Representations
Vol. 26, no. 3, pp. 285-306, 2022. Regular paper.
DOI: 10.7155/jgaa.00594
Editor in Chief's Foreword
Giuseppe Liotta
Vol. 26, no. 3, pp. 283-284, 2022. Regular paper.
DOI: 10.7155/jgaa.00593
An Improvement of Reed’s Treewidth Approximation
Vol. 26, no. 2, pp. 257-282, 2022. Regular paper.
DOI: 10.7155/jgaa.00592
Computing L(p,1)-Labeling with Combined Parameters
Tesshu Hanaka, Kazuma Kawai, and Hirotaka Ono
Vol. 26, no. 2, pp. 241-255, 2022. Regular paper.
DOI: 10.7155/jgaa.00591
On Compatible Matchings
Vol. 26, no. 2, pp. 225-240, 2022. Regular paper.
DOI: 10.7155/jgaa.00590
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
Vol. 26, no. 2, pp. 209-224, 2022. Regular paper.
DOI: 10.7155/jgaa.00589
Guest Editors’ Foreword
Seok-Hee Hong, Subhas C. Nandy, and Ryuhei Uehara
Vol. 26, no. 2, pp. 207-208, 2022. Regular paper.
Editorial Board
U. Brandes (ETH Zürich)
G. Di Battista (U Roma Tre)
W. S. Evans (U British Columbia)
G. Even (Tel-Aviv U)
P. Ferragina (U Pisa)
M. Fürer (Penn State U)
X. He (U Buffalo)
S. Hong (U Sydney)
M. Kaufmann (U Tübingen)
S. G. Kobourov (U Arizona)
A. Lubiw (U Waterloo)
H. Meijer (Roosevelt Academy)
J. S. B. Mitchell (Stony Brook U)
P. Mutzel (U Bonn)
M. Nöllenburg (TU Wien)
Y. Okamoto (U Electro-Communications)
M. S. Rahman (BUET)
I. Rutter (U Passau)
A. Symvonis (NTUA)
C. D. Tóth (CSUN)
F. Vandin (U Padova)
S. Whitesides (Victoria U)
A. Wolff (U Würzburg)
Past editors
Advisory Board
I. Chlamtac (CREATE-NET)
P. Eades (U Sydney)
G. N. Frederickson (Purdue U)
M. T. Goodrich (U California, Irvine)
T. C. Hu (U California, San Diego)
D. E. Knuth (Stanford U)
K. Mehlhorn (MPI-INF)
T. Nishizeki (Tohoku U)
F. P. Preparata (Brown U)
I. H. Sudborough (U Texas, Dallas)
R. E. Tarjan (Princeton U)
D. Wagner (U Karlsruhe)
T. Warnow (U Illinois, Urbana-Champaign)
M. Yannakakis (Columbia U)
In memoriam