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.00618
Simplifying Non-Simple Fan-Planar Drawings
Vol. 27, no. 2, pp. 147-172, 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.00615
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Vol. 27, no. 2, pp. 71-94, 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.00613
Guest Editors’ Foreword
Ignaz Rutter and Helene Purchase
Vol. 27, no. 2, pp. 45-47, 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.
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.00607
The Minimum Moving Spanning Tree Problem
Vol. 27, no. 1, pp. 1-18, 2023. 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