Health Score

0 Fair

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

Your prioritized action plan

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

Deposit reference lists for 210 records

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

High impact210 DOIs

Attach ORCID iDs across 130 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact130 DOIs

Add license metadata to 25 records

License metadata tells indexers and readers how each article may be reused.

Low impact25 DOIs

DOIs for this ISSN

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

#	Title	Missing	Priority	Citations
1	Cayley graphs of basic algebraic structures (10.23638/dmtcs-21-1-16)	References ORCID License	45.15	3
2	Wilf classification of triples of 4-letter patterns II (10.23638/dmtcs-19-1-6)	References License	42.25	6
3	On a combination of the 1-2-3 Conjecture and the Antimagic L… (10.23638/dmtcs-19-1-21)	References ORCID License	35.78	2
4	Total Domination, Connected Vertex Cover and Steiner Tree wi… (10.23638/dmtcs-19-3-17)	References ORCID License	35.78	2
5	On the multipacking number of grid graphs (10.23638/dmtcs-21-3-23)	References ORCID	30.10	3
6	The repetition threshold for binary rich words (10.23638/dmtcs-22-1-6)	References ORCID	30.10	3
7	Postorder Preimages (10.23638/dmtcs-19-1-3)	References ORCID	23.86	2
8	Binary Codes and Period-2 Orbits of Sequential Dynamical Sys… (10.23638/dmtcs-19-3-10)	References ORCID	23.86	2
9	Longest Gapped Repeats and Palindromes (10.23638/dmtcs-19-4-4)	References ORCID	23.86	2
10	Parameterized Complexity of Equitable Coloring (10.23638/dmtcs-21-1-8)	References ORCID	23.86	2
11	Exact values for three domination-like problems in circular… (10.23638/dmtcs-21-3-12)	References License	23.86	2
12	Equitable Coloring and Equitable Choosability of Planar Grap… (10.23638/dmtcs-21-3-16)	References ORCID	23.86	2
13	On the centroid of increasing trees (10.23638/dmtcs-21-4-8)	References ORCID	23.86	2
14	Inversion sequences avoiding pairs of patterns (10.23638/dmtcs-22-1-23)	References ORCID	23.86	2
15	A new sufficient condition for a Digraph to be Hamiltonian-A… (10.23638/dmtcs-22-4-12)	References ORCID	23.86	2
16	A characterization of trees with equal 2-domination and 2-in… (10.23638/dmtcs-19-1-1)	References ORCID	15.05	1
17	Decidability of multiset, set and numerically decipherable d… (10.23638/dmtcs-19-1-11)	References ORCID	15.05	1
18	On universal partial words (10.23638/dmtcs-19-1-16)	References ORCID	15.05	1
19	Characterizations of minimal dominating sets and the well-do… (10.23638/dmtcs-19-1-25)	References ORCID	15.05	1
20	A sufficient condition for a balanced bipartite digraph to b… (10.23638/dmtcs-19-3-11)	References ORCID	15.05	1
21	Self-Stabilizing Disconnected Components Detection and Roote… (10.23638/dmtcs-19-3-14)	References License	15.05	1
22	A Characterization for Decidable Separability by Piecewise T… (10.23638/dmtcs-19-4-1)	References ORCID	15.05	1
23	Protected node profile of Tries (10.23638/dmtcs-20-1-12)	References License	15.05	1
24	On interval number in cycle convexity (10.23638/dmtcs-20-1-13)	References License	15.05	1
25	Weighted Regular Tree Grammars with Storage (10.23638/dmtcs-20-1-26)	References ORCID	15.05	1
26	Sigma Partitioning: Complexity and Random Graphs (10.23638/dmtcs-20-2-19)	References ORCID	15.05	1
27	On locally irregular decompositions and the 1-2 Conjecture i… (10.23638/dmtcs-20-2-7)	References License	15.05	1
28	On Weakly Distinguishing Graph Polynomials (10.23638/dmtcs-21-1-4)	References ORCID	15.05	1
29	The 2-domination and Roman domination numbers of grid graphs (10.23638/dmtcs-21-1-9)	References ORCID	15.05	1
30	A code for square permutations and convex permutominoes (10.23638/dmtcs-21-2-2)	References ORCID	15.05	1
31	On the number of pancake stacks requiring four flips to be s… (10.23638/dmtcs-21-2-5)	References	15.05	3
32	Consecutive Patterns in Inversion Sequences (10.23638/dmtcs-21-2-6)	References ORCID	15.05	1
33	Non-crossing paths with geographic constraints (10.23638/dmtcs-21-3-15)	References ORCID	15.05	1
34	Planar 3-SAT with a Clause/Variable Cycle (10.23638/dmtcs-21-3-18)	References ORCID	15.05	1
35	Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-… (10.23638/dmtcs-21-3-20)	References ORCID	15.05	1
36	Efficient enumeration of solutions produced by closure opera… (10.23638/dmtcs-21-3-22)	References	15.05	3
37	$K_{1,3}$-covering red and blue points in the plane (10.23638/dmtcs-21-3-6)	References ORCID	15.05	1
38	Packing coloring of generalized Sierpinski graphs (10.23638/dmtcs-21-3-7)	References ORCID	15.05	1
39	New results on classical and quantum counter automata (10.23638/dmtcs-21-4-12)	References ORCID	15.05	1
40	On the inducibility of small trees (10.23638/dmtcs-21-4-13)	References ORCID	15.05	1
41	Generalized Petersen graphs and Kronecker covers (10.23638/dmtcs-21-4-15)	References License	15.05	1
42	A note on the convexity number for complementary prisms (10.23638/dmtcs-21-4-4)	References ORCID	15.05	1
43	The Complexity of Helly-$B_{1}$ EPG Graph Recognition (10.23638/dmtcs-22-1-19)	References ORCID	15.05	1
44	Evacuating Robots from a Disk Using Face-to-Face Communicati… (10.23638/dmtcs-22-4-4)	References ORCID	15.05	1
45	Even cycles and perfect matchings in claw-free plane graphs (10.23638/dmtcs-22-4-6)	References ORCID	15.05	1
46	Extension Complexity, MSO Logic, and Treewidth (10.23638/dmtcs-22-4-8)	References ORCID	15.05	1
47	Two lower bounds for $p$-centered colorings (10.23638/dmtcs-22-4-9)	References ORCID	15.05	1
48	Lattice paths with catastrophes (10.23638/dmtcs-19-1-23)	References	11.93	2
49	Steiner Distance in Product Networks (10.23638/dmtcs-20-2-8)	References	11.93	2
50	Expected Number of Distinct Subsequences in Randomly Generat… (10.23638/dmtcs-19-2-10)	References	7.53	1