Unresolvable Identifier
critical
doi_compliance
unresolvable_identifier
Identifier '10.1016/0020-0190(92' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.
Paper page Integrity report arXiv Try DOI
Evidence text
14 Thang Nguyen Bui and Curt Jones. Finding good approximate vertex and edge partitions is NP-hard.Information Processing Letters, 42(3):153–159, 1992.doi:10.1016/0020-0190(92) 90140-Q. 15 Jean Cardinal and Gwenaël Joret. Hitting all maximal independent sets of a bipartite graph. Algorithmica, 72(2):359–368, 2015.doi:10.1007/s00453-013-9847-3. 16 Steven Chaplick, Grzegorz Gutowski, and Tomasz Krawczyk. A note on the complexity of defensive domination. In50th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 345 ofLIPIcs, pages 35:1–35:15, 2025.doi:10.4230/ LIPIcs.MFCS.2025.35. 17 Rajat Chaudhary and Neeraj Kumar. Parc: Placement availability resilient controller scheme for software-defined datacenters.IEEE Transactions on Vehicular Technology, 69(8):8985–9001, 2020.doi:10.1109/TVT.2020.2999072. 18 Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms. Springer,
Evidence payload
{
"arxiv_id": null,
"checked_sources": [
"crossref_by_doi",
"openalex_by_doi",
"doi_org_head"
],
"doi": "10.1016/0020-0190(92",
"raw_excerpt": "14 Thang Nguyen Bui and Curt Jones. Finding good approximate vertex and edge partitions is NP-hard.Information Processing Letters, 42(3):153\u2013159, 1992.doi:10.1016/0020-0190(92) 90140-Q. 15 Jean Cardinal and Gwena\u00ebl Joret. Hitting all maximal independent sets of a bipartite graph. Algorithmica, 72(2):359\u2013368, 2015.doi:10.1007/s00453-013-9847-3. 16 Steven Chaplick, Grzegorz Gutowski, and Tomasz Kraw",
"ref_index": 2,
"verdict_class": "cross_source"
}