{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:15:49Z","timestamp":1726514149883},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0020-0190(79)90144-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"64-66","source":"Crossref","is-referenced-by-count":4,"title":["Even initial feedback vertex set problem is NP-complete"],"prefix":"10.1016","volume":"8","author":[{"given":"Dan A.","family":"Simovici","sequence":"first","affiliation":[]},{"given":"Gh.","family":"Grigoras","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90144-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","first-page":"378","author":"Aho","year":"1975"},{"key":"10.1016\/0020-0190(79)90144-3_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proc. Third Annual ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0020-0190(79)90144-3_BIB3","series-title":"Complexity of Computer Computations","article-title":"Reducibility among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(79)90144-3_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the Computational Complexity of Combinatorial Problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:0020019079901443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:0020019079901443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T13:46:19Z","timestamp":1580910379000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0020019079901443"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/0020-0190(79)90144-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}