Journal of Graph Algorithms and Applications

Aims & Scope

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.

Topics of interest for JGAA include but are not limited to: -Design and analysis of graph algorithms: exact and approximation graph algorithms; centralized and distributed graph algorithms; static and dynamic graph algorithms; internal- and external-memory graph algorithms; sequential and parallel graph algorithms; deterministic and randomized graph algorithms. -Experiences with graph and network algorithms: animations; experimentations; implementations. -Applications of graph and network algorithms: biomedical informatics; computational biology; computational geometry; computer graphics; computer-aided design; computer and interconnection networks; constraint systems; databases; economic networks; graph drawing; graph embedding and layout; knowledge representation; multimedia; social networks; software engineering; telecommunication networks; user interfaces and visualization; VLSI circuits.

Metrics & Ranking

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Directory of Open Access Journals (DOAJ)

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

Licensing & Copyright

This journal operates under an Open Access model. Articles are freely accessible to the public immediately upon publication. The content is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0), allowing users to share and adapt the work with proper attribution.

Copyright remains with the author(s), and no permission is required for non-commercial use, provided the original source is cited.

Policy Links

This section provides access to essential policy documents, guidelines, and resources related to the journal’s publication and submission processes.

• Aims scope
• Homepage
• Oa statement
• Author instructions
• License terms
• Review url
• Board url
• Copyright url
• Apc url
• License

APC Details

The journal’s Article Processing Charge (APC) policies support open access publishing in Computer Science and Mathematics, ensuring accessibility and quality in research dissemination.

This journal does not charge a mandatory Article Processing Charge (APC). However, optional open access publication may incur fees based on the publisher’s policies.

Explore journals without APCs for alternative publishing options.

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Computing Communities in Large Networks Using Random Walks

  Citation: 1033

  Authors: Pascal, Matthieu

• Subgraph Isomorphism in Planar Graphs and Related Problems

  Citation: 172

  Authors: David

• Approximating Clustering Coefficient and Transitivity

  Citation: 165

  Authors: Thomas, Dorothea

• Energy Models for Graph Clustering

  Citation: 163

  Authors: Andreas

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

  Citation: 119

  Authors: Michael, Petra

• The Knapsack Problem with Conflict Graphs

  Citation: 117

  Authors: Ulrich, Joachim

• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

  Citation: 117

  Authors: John M., Wendy J.

• A Multilevel Algorithm for Force-Directed Graph-Drawing

  Citation: 113

  Authors: Chris

• A Fast Multi-Scale Method for Drawing Large Graphs

  Citation: 96

  Authors: David, Yehuda

• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

  Citation: 94

  Authors: Michael, Roland