Journal of Graph Algorithms and Applications

Editor-in-Chief

University of Perugia

giuseppe.liotta@unipg.it

Publication Editor

University of Perugia

emilio.digiacomo@unipg.it

Executive Committee

University of Perugia

Brown University

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.

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.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.

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.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.00621

Improved (In-)Approximability Bounds for d-Scattered Set

Ioannis Katsikarelis, Michael Lampis, and Vangelis Th. Paschos

Vol. 27, no. 3, pp. 219-238, 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.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.

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. 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