Journal of Graph Algorithms and Applications

Editors-in-Chief

University of Perugia

Technische Universität Wien

Publication Editor

F. Montecchiani

University of Perugia

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

Paper submission

Papers should be submitted to the following address [email protected] in PDF format. Please read the instructions for authors for more details

News

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.

Recently Published

DOI: 10.7155/jgaa.00647

2-Layer Graph Drawings with Bounded Pathwidth

David R. Wood

Vol. 27, no. 9, pp. 843-851, 2023. Concise paper.

DOI: 10.7155/jgaa.00646

RAC-Drawability is ∃ℝ-complete and Related Results

Marcus Schaefer

Vol. 27, no. 9, pp. 803-841, 2023. Regular paper.

DOI: 10.7155/jgaa.00645

Drawing Order Diagrams Through Two-Dimension Extension

Dominik Dürrschnabel, Tom Hanika, and Gerd Stumme

Vol. 27, no. 9, pp. 783-802, 2023. Regular paper.

DOI: 10.7155/jgaa.00644

Minimum Linear Arrangement of Generalized Sierpinski Graphs

Sundara Rajan R, Berin Greeni A, and Leo Joshwa P

Vol. 27, no. 9, pp. 767-782, 2023. Regular paper.

DOI: 10.7155/jgaa.00643

The Computational Complexity of the ChordLink Model

Philipp Kindermann, Jan Sauer, and Alexander Wolff

Vol. 27, no. 9, pp. 759-767, 2023. Concise paper.

DOI: 10.7155/jgaa.00641

Effective Computation of a Feedback Arc Set Using PageRank

Vasileios Geladaris, Panagiotis Lionakis, and Ioannis G. Tollis

Vol. 27, no. 8, pp. 737-757, 2023. Regular paper.

DOI: 10.7155/jgaa.00637

Empty Triangles in Generalized Twisted Drawings of $K_n$

Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger

Vol. 27, no. 8, pp. 721-735, 2023. Regular paper.

DOI: 10.7155/jgaa.00640

Rectilinear Planarity of Partial 2-Trees

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, and Giacomo Ortali

Vol. 27, no. 8, pp. 679-719, 2023. Regular paper.

DOI: 10.7155/jgaa.00639

Small Point-Sets Supporting Graph Stories

Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, and Alessandra Tappini

Vol. 27, no. 8, pp. 651-677, 2023. Regular paper.

DOI: 10.7155/jgaa.00638

$st$-Orientations with Few Transitive Edges

Carla Binucci, Walter Didimo, and Maurizio Patrignani

Vol. 27, no. 8, pp. 625-650, 2023. Regular paper.

DOI: 10.7155/jgaa.00642

Guest Editors' Foreword

Patrizio Angelini and Reinhard von Hanxleden

Vol. 27, no. 8, pp. 621-623, 2023. Regular paper.

DOI: 10.7155/jgaa.00636

A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs

Alane M. de Lima, Murilo V. G. da Silva, and André L. Vignatti

Vol. 27, no. 7, pp. 603-619, 2023. Regular paper.

DOI: 10.7155/jgaa.00635

A Heuristic for Direct Product Graph Decomposition

Luca Calderoni, Luciano Margara, and Moreno Marzolla

Vol. 27, no. 7, pp. 581-601, 2023. Regular paper.

DOI: 10.7155/jgaa.00634

The Complexity of Angular Resolution

Marcus Schaefer

Vol. 27, no. 7, pp. 565-580, 2023. Regular paper.

DOI: 10.7155/jgaa.00633

Computing consensus networks for collections of 1-nested phylogenetic networks

Katharina T. Huber, Vincent Moulton, and Andreas Spillner

Vol. 27, no. 7, pp. 541-563, 2023. Regular paper.

DOI: 10.7155/jgaa.00632

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

Sabine Cornelsen and Gregor Diatzko

Vol. 27, no. 7, pp. 523-540, 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)

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)

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)

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