1526-1719

Journal of Graph Algorithms and Applications

Journal of Algorithms and Applications

View prefix report (10.7155)

Health Score

0 Poor

Metadata coverage

Abstract
ORCID
References
License

Extended metadata coverage

Informational — signals of interoperability and funding across the corpus. Not part of the health score.

Funding

Funder
Award / grant

Affiliation & institutional identifiers

Affiliation
ROR ID

Update policy

Update policy

Your prioritized action plan

Ordered by how many DOIs each fix touches — start here, not with every error at once.

1

Deposit reference lists for 721 records

Deposited references power Crossref's Cited-by links between your articles and the literature.

High impact721 DOIs
2

Attach ORCID iDs across 685 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact685 DOIs
3

Add abstracts to 389 articles

Abstracts are what surface your work in Google Scholar, Dimensions, and OpenAlex.

High impact389 DOIs

DOIs for this ISSN

Showing the top 5 of 721 DOIs, ordered by correction priority.

# Title Missing Priority Citations
1 Computing Communities in Large Networks Using Random Walks (10.7155/jgaa.00124)
Abstract References ORCID License
304.73 1114
2 Subgraph Isomorphism in Planar Graphs and Related Problems (10.7155/jgaa.00014)
Abstract References ORCID License
224.30 174
3 Energy Models for Graph Clustering (10.7155/jgaa.00154)
Abstract References ORCID License
223.55 171
4 Approximating Clustering Coefficient and Transitivity (10.7155/jgaa.00108)
Abstract References ORCID License
222.79 168
5 The Knapsack Problem with Conflict Graphs (10.7155/jgaa.00186)
Abstract References ORCID License
210.38 126
6 2-Layer Straightline Crossing Minimization: Performance of E… (10.7155/jgaa.00001)
Abstract References ORCID License
208.64 121
7 On the Cutting Edge: Simplified O(n) Planarity by Edge Addit… (10.7155/jgaa.00091)
Abstract References ORCID License
208.64 121
8 A Multilevel Algorithm for Force-Directed Graph-Drawing (10.7155/jgaa.00070)
Abstract References ORCID License
205.69 113
9 A Fast Multi-Scale Method for Drawing Large Graphs (10.7155/jgaa.00051)
Abstract References ORCID License
199.12 97
10 Embedding Vertices at Points: Few Bends Suffice for Planar G… (10.7155/jgaa.00046)
Abstract References ORCID License
197.77 94
11 Navigating Clustered Graphs Using Force-Directed Methods (10.7155/jgaa.00029)
Abstract References ORCID License
192.43 83
12 Approximations of Weighted Independent Set and Hereditary Su… (10.7155/jgaa.00020)
Abstract References ORCID License
190.85 80
13 Fast Approximation of Centrality (10.7155/jgaa.00081)
Abstract References ORCID License
183.88 68
14 Planarizing Graphs - A Survey and Annotated Bibliography (10.7155/jgaa.00032)
Abstract References ORCID License
182.61 66
15 The Star Clustering Algorithm for Static and Dynamic Informa… (10.7155/jgaa.00084)
Abstract References ORCID License
181.29 64
16 Small Maximal Independent Sets and Faster Exact Graph Colori… (10.7155/jgaa.00064)
Abstract References ORCID License
180.62 63
17 Large-Graph Layout Algorithms at Work: An Experimental Study (10.7155/jgaa.00150)
Abstract References ORCID License
180.62 63
18 Straight-Line Drawings on Restricted Integer Grids in Two an… (10.7155/jgaa.00075)
Abstract References ORCID License
179.93 62
19 The Traveling Salesman Problem for Cubic Graphs (10.7155/jgaa.00137)
Abstract References ORCID License
177.82 59
20 Challenging Complexity of Maximum Common Subgraph Detection… (10.7155/jgaa.00139)
Abstract References ORCID License
177.82 59
21 Graph Layout Aesthetics in UML Diagrams: User Preferences (10.7155/jgaa.00054)
Abstract References ORCID License
176.34 57
22 Planar embeddability of the vertices of a graph using a fixe… (10.7155/jgaa.00132)
Abstract References ORCID License
174.04 54
23 Estimating the Number of s-t Paths in a Graph (10.7155/jgaa.00142)
Abstract References ORCID License
174.04 54
24 Confluent Drawings: Visualizing Non-planar Diagrams in a Pla… (10.7155/jgaa.00099)
Abstract References ORCID License
172.43 52
25 On the Approximability of Comparing Genomes with Duplicates (10.7155/jgaa.00175)
Abstract References ORCID License
170.76 50
26 GRIP: Graph Drawing with Intelligent Placement (10.7155/jgaa.00052)
Abstract References ORCID License
169.90 49
27 An Efficient Algorithm for the Transversal Hypergraph Genera… (10.7155/jgaa.00107)
Abstract References ORCID License
169.90 49
28 Geometric Thickness of Complete Graphs (10.7155/jgaa.00023)
Abstract References ORCID License
168.12 47
29 Vertex Intersection Graphs of Paths on a Grid (10.7155/jgaa.00253)
Abstract References ORCID License
168.12 47
30 Optimal Algorithms to Embed Trees in a Point Set (10.7155/jgaa.00002)
Abstract References ORCID License
167.21 46
31 Toward a Theory of Planarity: Hanani-Tutte and Planarity Var… (10.7155/jgaa.00298)
Abstract References ORCID License
165.32 44
32 Graph Drawing in Motion (10.7155/jgaa.00057)
Abstract References ORCID License
162.32 41
33 Triangle Sparsifiers (10.7155/jgaa.00245)
Abstract References ORCID License
162.32 41
34 Graph Drawing by High-Dimensional Embedding (10.7155/jgaa.00089)
Abstract References ORCID License
161.28 40
35 Algorithms for Cluster Busting in Anchored Graph Drawing (10.7155/jgaa.00004)
Abstract References ORCID License
160.21 39
36 Effects of Sociogram Drawing Conventions and Edge Crossings… (10.7155/jgaa.00152)
Abstract References ORCID License
159.11 38
37 Visualizing Interdomain Routing with BGPlay (10.7155/jgaa.00102)
Abstract References ORCID License
157.98 37
38 Simultaneous Embedding of Planar Graphs with Few Bends (10.7155/jgaa.00113)
Abstract References ORCID License
157.98 37
39 Finding Dominators in Practice (10.7155/jgaa.00119)
Abstract References ORCID License
155.63 35
40 An Algorithm to Construct Greedy Drawings of Triangulations (10.7155/jgaa.00197)
Abstract References ORCID License
155.63 35
41 Treewidth and Minimum Fill-in on d-Trapezoid Graphs (10.7155/jgaa.00008)
Abstract References ORCID License
154.41 34
42 Drawing Clustered Graphs on an Orthogonal Grid (10.7155/jgaa.00016)
Abstract References ORCID License
150.51 31
43 Bar k-Visibility Graphs (10.7155/jgaa.00136)
Abstract References ORCID License
150.51 31
44 Accelerated Bend Minimization (10.7155/jgaa.00265)
Abstract References ORCID License
150.51 31
45 Interactive Visualization of Streaming Text Data with Dynam… (10.7155/jgaa.00302)
Abstract References ORCID License
150.51 31
46 Low-degree Graph Partitioning via Local Search with Applicat… (10.7155/jgaa.00003)
Abstract References ORCID License
149.14 30
47 A Linear Algorithm for Bend-Optimal Orthogonal Drawings of T… (10.7155/jgaa.00017)
Abstract References ORCID License
149.14 30
48 Radial Level Planarity Testing and Embedding in Linear Time (10.7155/jgaa.00100)
Abstract References ORCID License
149.14 30
49 The Straight-Line RAC Drawing Problem is NP-Hard (10.7155/jgaa.00274)
Abstract References ORCID License
149.14 30
50 1-Visibility Representations of 1-Planar Graphs (10.7155/jgaa.00330)
Abstract References ORCID License
149.14 30