{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:52:36Z","timestamp":1773834756962,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11581,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1016\/0166-218x(81)90003-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:04:08Z","timestamp":1034273048000},"page":"257-262","source":"Crossref","is-referenced-by-count":37,"title":["Planar kernel and grundy with d\u22643, dout\u22642, din\u22642 are NP-complete"],"prefix":"10.1016","volume":"3","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90003-2_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(81)90003-2_BIB2","series-title":"Report No. CRM-300","article-title":"On the computational complexity of finding a kernel","author":"Chv\u00e1tal","year":"1973"},{"key":"10.1016\/0166-218X(81)90003-2_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(79)90012-X","article-title":"Complexity of problems in games, graphs and algebraic equations","volume":"1","author":"Fraenkel","year":"1979","journal-title":"Discrete Applied Math"},{"key":"10.1016\/0166-218X(81)90003-2_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(81)90003-2_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/0166-218X(81)90003-2_BIB6","unstructured":"D. Lichtenstein, Planar satisfiability and its uses, SIAM J. Comput., to appear."},{"key":"10.1016\/0166-218X(81)90003-2_BIB7","series-title":"Report No. 207","article-title":"Having a Grundy-numbering is NP-complete","author":"van Leeuwen","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:23:19Z","timestamp":1555176199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["0166218X81900032"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90003-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}