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

A faster algorithm for maximum independent set on interval filament graphs

Darcy Best and Max Ward

Vol. 26, no. 1, pp. 199-205, 2022. Concise paper.

DOI: 10.7155/jgaa.00587

Upward planar drawings with two slopes

Jonathan Klawitter and Tamara Mchedlidze

Vol. 26, no. 1, pp. 171-198, 2022. Regular paper.

DOI: 10.7155/jgaa.00586

Crossing Numbers of Beyond-Planar Graphs Revisited

Nathan van Beusekom, Irene Parada, and Bettina Speckmann

Vol. 26, no. 1, pp. 149-170, 2022. Regular paper.

DOI: 10.7155/jgaa.00585

Properties of Large 2-Crossing-Critical Graphs

Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, and Tilo Wiedera

Vol. 26, no. 1, pp. 111-147, 2022. Regular paper.

DOI: 10.7155/jgaa.00584

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

Vahan Mkrtchyan and Garik Petrosyan

Vol. 26, no. 1, pp. 91-110, 2022. Regular paper.

DOI: 10.7155/jgaa.00583

Non-binary universal tree-based networks

Mareike Fischer, Michelle Galla, and Kristina Wicke

Vol. 26, no. 1, pp. 81-90, 2022. Regular paper.

DOI: 10.7155/jgaa.00582

A short proof of the non-biplanarity of $K_9$

Ahmad Biniaz

Vol. 26, no. 1, pp. 75-80, 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