Journal of Graph Algorithms and Applications
|Home||Issues||About JGAA||Instructions for Authors|
University of Perugia
JGAA Indexing and Ranking
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.
Papers should be submitted to the following address firstname.lastname@example.org in PDF format. Please read the instructions for authors for more details
July 2023. The Executive Committee of JGAA is pleased to announce the appointment of Emilio Di Giacomo and Martin Nöllenburg as Editors-in-Chief of JGAA, effective July 1, 2023.
After serving for more than nine years as editor-in-chief of JGAA, Giuseppe Liotta stepped down from this position but will continue to actively support the growth of JGAA as a member of the JGAA Executive Committee.
The whole JGAA team thanks Giuseppe Liotta for his valuable work that contributed to the growth of the journal.
Vol. 27, no. 7, pp. 603-619, 2023. Regular paper.
Vol. 27, no. 7, pp. 581-601, 2023. Regular paper.
Vol. 27, no. 7, pp. 565-580, 2023. Regular paper.
Vol. 27, no. 7, pp. 541-563, 2023. Regular paper.
Sabine Cornelsen and Gregor Diatzko
Vol. 27, no. 7, pp. 523-540, 2023. Regular paper.
Vol. 27, no. 6, pp. 489-522, 2023. Regular paper.
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, and Alexander Wolff
Vol. 27, no. 6, pp. 459-488, 2023. Regular paper.
Alan Arroyo and Stefan Felsner
Vol. 27, no. 6, pp. 433-457, 2023. Regular paper.
Vol. 27, no. 6, pp. 409-431, 2023. Regular paper.
Vol. 27, no. 6, pp. 405-408, 2023. Regular paper.
Vol. 27, no. 5, pp. 341-404, 2023. Regular paper.
Vol. 27, no. 5, pp. 329-339, 2023. Regular paper.
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)
Y. Okamoto (U Electro-Communications)
Md. 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)
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)
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)