
Academic Journal
Q2Journal of Graph Algorithms and Applications
About Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications is a scholarly journal published by Brown University. SCImago 2025 lists it in Q2, with an SJR of 0.352 and H-index of 41.
Coverage: 1997-2026. Research categories: Computer Science (miscellaneous) (Q2); Computational Theory and Mathematics (Q3); Computer Science Applications (Q3); Geometry and Topology (Q3); Theoretical Computer Science (Q3).
Open-access policies and author information
Reported in the official DOAJ public CSV snapshot (2026-09-01), downloaded 2026-10-03. Record updated 2025-12-19. This snapshot does not establish today’s listing status or fee quotation.
Publisher policy links recorded by DOAJ
- Aims and scope ↗
- Editorial board ↗
- Instructions for authors ↗
- Peer-review policy ↗
- Publication fees ↗
- Licence terms ↗
- Copyright policy ↗
Source: DOAJ journal record. Journal metadata is distributed by DOAJ under CC0. Confirm current fees, tax, eligibility and waiver terms with the publisher.
Source-backed journal facts
Topics in published research
Computational Geometry and Mesh Generation; Advanced Graph Theory Research; Complexity and Algorithms in Graphs; Data Visualization and Analytics; Data Management and Algorithms; Digital Image Processing Techniques.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
A Kernel for the Maximum Agreement Forest Problem on Multiple Binary Phylogenetic Trees
Steven Kelk, Leo Van Iersel, Ruben Meuwese
2026-08-24 · DOI: 10.7155/jgaa.v30i1.3194The Parameter Report: An Orientation Guide for Data-Driven Parameterization
Christian Komusiewicz, Nils Morawietz, Frank Sommer, Luca Pascal Staus et al.
2026-08-24 · DOI: 10.7155/jgaa.v30i1.3100Visualizing Treewidth
Alvin Chiu, Thomas Depian, David Eppstein, Michel T. Goodrich et al.
2026-08-19 · DOI: 10.7155/jgaa.v30i2.3273A New Simple Algorithm for Computing Maximum Weight Induced Forests in Circle Graphs
Nicholas Nash
2026-08-19 · DOI: 10.7155/jgaa.v30i1.3137On Shortest Path, BFS- and DFS-Tree Graphs
Prosenjit Bose, Amirali Madani, Anil Maheshwari, Bobby Miraftab et al.
2026-08-19 · DOI: 10.7155/jgaa.v30i1.3052Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
Aaron Büngener, Michael Kaufmann
2026-08-05 · DOI: 10.7155/jgaa.v29i3.3000Computing Complexity Measures of Degenerate Graphs
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl et al.
2026-07-17 · DOI: 10.7155/jgaa.v30i1.2980OOPS: Optimized One-Planarity Solver via SAT
Sergey Pupyrev
2026-07-17 · DOI: 10.7155/jgaa.v30i2.3114Polynomial-Time Derivation of Optimal $k$-Tree Topology from Markov Networks
Fereshteh R. Dastjerdi, Liming Cai
2026-06-26 · DOI: 10.7155/jgaa.v30i1.3236Structural Parameterizations of $k$-Planarity
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
2026-06-26 · DOI: 10.7155/jgaa.v30i1.3095Fast Schulze Voting Using Quickselect
Arushi Arora, David Eppstein, Randy Le Huynh
2026-06-24 · DOI: 10.7155/jgaa.v30i1.3030On Relations between Neighborhoods of Threshold and Ferrers Digraphs
Gordana Marmulla, Ulrik Brandes
2026-06-24 · DOI: 10.7155/jgaa.v30i1.3099Monotone Arc Diagrams with few Biarcs
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann et al.
2026-06-22 · DOI: 10.7155/jgaa.v29i3.3006Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber
2026-06-15 · DOI: 10.7155/jgaa.v29i3.3004Parameterized Linear Time Transitive Closure
Giorgos Kritikakis, Ioannis Tollis
2026-06-12 · DOI: 10.7155/jgaa.v30i1.3148Minimizing the Height of Simple Tangles
Jakob Baumann, Ignaz Rutter
2026-06-10 · DOI: 10.7155/jgaa.v30i1.3220The Parameterized Complexity Of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg et al.
2026-06-09 · DOI: 10.7155/jgaa.v29i3.3221Edge Densities of Drawings of Graphs with One Forbidden Cell
Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber
2026-05-26 · DOI: 10.7155/jgaa.v30i2.3119Heuristics for Exact 1-Planarity Testing
Miriam Münch, Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter et al.
2026-04-29 · DOI: 10.7155/jgaa.v30i2.3136A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe et al.
2026-04-28 · DOI: 10.7155/jgaa.v30i2.3112Reviews
Community Reviews
Version History
October 4, 2026 at 9:26 pm
October 2, 2026