Journal of Graph Algorithms and Applications

Editor-in-Chief

G. Liotta

University of Perugia

giuseppe.liotta@unipg.it

Founding Editors

R. Tamassia

Brown University

I. G. Tollis

University of Crete and ICS-FORTH

JGAA is member of the Free Journal Network.

JGAA Indexing and Ranking

JGAA is indexed by Scopus. The peformance of JGAA are measured by SCImago. The performance indices of JGAA are shown in the chart below. In particular, the Cites per Doc. index, which denotes the average number of citations per document in a two-year period, is computed using the same formula as that of the journal impact factor™ (Thomson Reuters).

Advisory Board

I. Chlamtac

CREATE-NET

P. Eades

University of Sydney

G. N. Frederickson

Purdue University

M. T. Goodrich

University of California at Irvine

T. C. Hu

University of California at San Diego

D. E. Knuth

Stanford University

C. L. Liu

Academia Sinica

K. Mehlhorn

Max-Planck Institut für Informatik

T. Nishizeki

Tohoku University

F. P. Preparata

Brown University

I. H. Sudborough

University of Texas at Dallas

R. E. Tarjan

Princeton University

T. Warnow

University of Illinois at Urbana-Champaign

M. Yannakakis

Columbia University

In Memoriam

S. Even

Technion

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 gold open access journal that charges no author fees.

View full aims and scope

News

April 2019. The Executive Committee of JGAA is pleased to announce the appointment of Yoshio Okamoto and Ignaz Rutter to the Editorial Board of JGAA.

Recently Published

DOI: 10.7155/jgaa.00489

Time Windowed Data Structures for Graphs

Farah Chanchary and Anil Maheshwari

Vol. 23, no. 2, pp. 191-226, 2019. Regular paper.

DOI: 10.7155/jgaa.00488

Finding a Maximum-Weight Convex Set in a Chordal Graph

Jean Cardinal, Jean-Paul Doignon, and Keno Merckx

Vol. 23, no. 2, pp. 167-190, 2019. Regular paper.

DOI: 10.7155/jgaa.00487

An effective crossing minimisation heuristic based on star insertion

Kieran Clancy, Michael Haythorpe, and Alex Newcombe

Vol. 23, no. 2, pp. 135-166, 2019. Regular paper.

DOI: 10.7155/jgaa.00486

How Bad is the Freedom to Flood-It?

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, and Yota Otachi

Vol. 23, no. 2, pp. 111-134, 2019. Regular paper.

DOI: 10.7155/jgaa.00485

Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems

Yuko Kuroki and Tomomi Matsui

Vol. 23, no. 1, pp. 93-110, 2019. Regular paper.

DOI: 10.7155/jgaa.00484

An Experimental Study on the Ply Number of Straight-line Drawings

Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov, and Giuseppe Liotta

Vol. 23, no. 1, pp. 71-91, 2019. Regular paper.

DOI: 10.7155/jgaa.00483

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

Jun Kawahara, Toshiki Saitoh, and Ryo Yoshinaka

Vol. 23, no. 1, pp. 29-70, 2019. Regular paper.

DOI: 10.7155/jgaa.00482

Sequentially Swapping Colored Tokens on Graphs

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno

Vol. 23, no. 1, pp. 3-27, 2019. Regular paper.

DOI: 10.7155/jgaa.00481

Guest Editors' Foreword

Md. Saidur Rahman, Hsu-Chun Yen, and Sheung-Hung Poon

Vol. 23, no. 1, pp. 1-2, 2019. Regular paper.

Executive Committee

G. Liotta

University of Perugia

R. Tamassia

Brown University

I. G. Tollis

University of Crete and ICS-FORTH