{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:55:11Z","timestamp":1648508111573},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":8629,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0022-0000(89)90026-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"323-342","source":"Crossref","is-referenced-by-count":6,"title":["Ordered vertex removal and subgraph problems"],"prefix":"10.1016","volume":"39","author":[{"given":"Raymond","family":"Greenlaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90026-3_BIB1","article-title":"A P-complete Problem and Approximations to It","author":"Anderson","year":"1984"},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90026-3_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90026-3_BIB3","series-title":"ACM Symp. on Theory of Comput.","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(89)90026-3_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90026-3_BIB5","first-page":"230","article-title":"The complexity of near-optimal graph coloring","volume":"25","author":"Garey","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90026-3_BIB6","author":"Garey","year":"1978"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90026-3_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems are log space complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(89)90026-3_BIB8","series-title":"A compendium of problems complete for P, draft","author":"Greenlaw","year":"1989"},{"key":"10.1016\/0022-0000(89)90026-3_BIB9","first-page":"85","article-title":"Reducibility Among Combinatorial Problems","author":"Karp","year":"1972"},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90026-3_BIB10","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(89)90026-3_BIB11","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0022-0000(89)90026-3_BIB12","series-title":"class notes CSci 533, Restricted versions of NAND CVP","author":"Ruzzo","year":"1986"},{"key":"10.1016\/0022-0000(89)90026-3_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90026-3_BIB14","series-title":"ACM Symp. on Theory of Comput.","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/0022-0000(89)90026-3_BIB15","series-title":"ACM Symp. on Theory of Comput.","first-page":"325","article-title":"A new approximate graph coloring algorithm","author":"Wigderson","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:22Z","timestamp":1550307322000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0022000089900263"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90026-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}