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

September 2021. The Journal of Graph Algorithms and Applications is pleased to announce a Special Issue about "Parameterized and Approximation Algorithms in Graph Drawing". This issue will be edited by Giordano Da Lozzo, and Philipp Kindermann. More details can be found on the Call for Papers.

Recently Published

DOI: 10.7155/jgaa.00568

On Strict (Outer-)Confluent Graphs

Henry Förster, Robert Ganian, Fabian Klute, and Martin Nöllenburg

Vol. 25, no. 1, pp. 481-512, 2021. Regular paper.

DOI: 10.7155/jgaa.00567

Decycling bipartite graphs

Alain Hertz

Vol. 25, no. 1, pp. 461-480, 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.00565

Tree Containment With Soft Polytomies

Matthias Bentert and Mathias Weller

Vol. 25, no. 1, pp. 417-436, 2021. Regular paper.

DOI: 10.7155/jgaa.00564

Least resolved trees for two-colored best match graphs

David Schaller, Manuela Geiß, Marc Hellmuth, and Peter F. Stadler

Vol. 25, no. 1, pp. 397-416, 2021. Regular paper.

DOI: 10.7155/jgaa.00563

The number of crossings in multigraphs with no empty lens

Michael Kaufmann, János Pach, Géza Tóth, and Torsten Ueckerdt

Vol. 25, no. 1, pp. 383-396, 2021. Regular paper.

Editorial Board

G. Barequet (Technion IIT)

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)

I. Rutter (U Passau)

A. Symvonis (NTUA)

C. D. Tóth (CSUN)

F. Vandin (U Padova)

S. Whitesides (Victoria U)

G. J. Woeginger (RWTH Aachen 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