Journal of Graph Algorithms and Applications

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

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

September 2014. The executive committee is proud to announce that according to SCImago JGAA is ranked as a Q1 journal in the following categories: Computational Theory and Mathematics, Geometry and Topology, Computer Science Applications, Theoretical Computer Science Computer Science (miscellaneous). The executive committee takes this opportunity to warmly thank the authors, the editors and the referees for their valuable contribution to the success of JGAA.

Recently Published

DOI: 10.7155/jgaa.00351

Ordering Metro Lines by Block Crossings

Martin Fink, Sergey Pupyrev, and Alexander Wolff

Vol. 19, no. 1, pp. 111-153, 2015. Regular paper.

DOI: 10.7155/jgaa.00350

Monotone Simultaneous Embeddings of Upward Planar Digraphs

Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, and Birgit Vogtenhuber

Vol. 19, no. 1, pp. 87-110, 2015. Regular paper.

DOI: 10.7155/jgaa.00347

1-Planarity of Graphs with a Rotation System

Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, and Josef Reislhuber

Vol. 19, no. 1, pp. 67-86, 2015. Regular paper.

DOI: 10.7155/jgaa.00346

Triangulations with Circular Arcs

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Kateřina Čech Dobiášová, Bert Jüttler, and Günter Rote

Vol. 19, no. 1, pp. 43-65, 2015. Regular paper.

DOI: 10.7155/jgaa.00345

Optimal Data Structures for Farthest-Point Queries in Cactus Networks

Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, and Michiel Smid

Vol. 19, no. 1, pp. 11-41, 2015. Regular paper.

DOI: 10.7155/jgaa.00344

Two-floor buildings need eight colors

Stéphane Bessy, Daniel Gonçalves, and Jean-Sébastien Sereni

Vol. 19, no. 1, pp. 1-9, 2015. Regular paper.

DOI: 10.7155/jgaa.00343

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs

William Evans, Michael Kaufmann, William Lenhart, Tamara Mchedlidze, and Stephen Wismath

Vol. 18, no. 5, pp. 721-739, 2014. Regular paper.

DOI: 10.7155/jgaa.00342

Computing the Characteristic Polynomial of Threshold Graphs

David P. Jacobs, Vilmar Trevisan, and Fernando Tura

Vol. 18, no. 5, pp. 709-719, 2014. Regular paper.

DOI: 10.7155/jgaa.00341

Column-Based Graph Layouts

Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, and Dorothea Wagner

Vol. 18, no. 5, pp. 677-708, 2014. Regular paper.

DOI: 10.7155/jgaa.00340

Multilayer Drawings of Clustered Graphs

Fabrizio Frati

Vol. 18, no. 5, pp. 633-675, 2014. Regular paper.

Just Accepted

The following papers have been accepted to be published in the JGAA Special Issue about GD 2014. These papers will receive a volume, an issue number, and page numbers when the whole special issue will be published.

DOI: 10.7155/jgaa.00348

Increasing-Chord Graphs On Point Sets

Hooman Reisi Dehkordi, Fabrizio Frati, and Joachim Gudmundsson

Vol. 0, no. 0, pp. 0-0, 0. Regular paper.

DOI: 10.7155/jgaa.00349

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

Michael J. Bannister, William E. Devanny, David Eppstein, and Michael T. Goodrich

Vol. 0, no. 0, pp. 0-0, 0. Regular paper.

Executive Committee

G. Liotta

University of Perugia

R. Tamassia