{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T03:24:34Z","timestamp":1763436274575},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80079-0","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"769-779","source":"Crossref","is-referenced-by-count":60,"title":["On search, decision, and the efficiency of polynomial-time algorithms"],"prefix":"10.1016","volume":"49","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80079-0_bib1","unstructured":"S. Cook and A. Gupta, private communication."},{"key":"10.1016\/S0022-0000(05)80079-0_bib2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","article-title":"Exact and approximate solutions for the gate matrix layout problem","volume":"6","author":"Deo","year":"1987","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0022-0000(05)80079-0_bib3","first-page":"157","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987"},{"key":"10.1016\/S0022-0000(05)80079-0_bib4","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80079-0_bib5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0405010","article-title":"On well-partional-order theory and its application to combinatorial problems of VLSI design","volume":"5","author":"Fellows","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0022-0000(05)80079-0_bib6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1090\/conm\/065\/891251","article-title":"The metamathematics of the graph minor theorem","volume":"65","author":"Friedman","year":"1987","journal-title":"Contemporary Math."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0022-0000(05)80079-0_bib7"},{"key":"10.1016\/S0022-0000(05)80079-0_bib8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02559591","article-title":"Theory der Normalfl\u00e4chen","volume":"105","author":"Haken","year":"1961","journal-title":"Acta Math."},{"key":"10.1016\/S0022-0000(05)80079-0_bib9","first-page":"115","article-title":"Universal enumeration problems","volume":"2","author":"Levin","year":"1972","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0022-0000(05)80079-0_bib10","doi-asserted-by":"crossref","unstructured":"M. A. Langston and S. Ramachandramurthi, Dense layouts for series-parallel circuits, in \u201cProceedings, 1991 Great Lake Symposium on VLSI\u201d, pp. 14\u201317.","DOI":"10.1109\/GLSV.1991.143935"},{"key":"10.1016\/S0022-0000(05)80079-0_bib11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Rieman's hypothesis and tests for primalty","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80079-0_bib12","doi-asserted-by":"crossref","unstructured":"B. Reed, Finding approximate separators and computing with tree width quickly, in \u201cProceedings, 1992 Symposium on Theory of Computing,\u201d pp. 221\u2013228.","DOI":"10.1145\/129712.129734"},{"key":"10.1016\/S0022-0000(05)80079-0_bib13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors. IV. Tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0022-0000(05)80079-0_bib14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","article-title":"Graph minors. V. Excluding a planar graph","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0022-0000(05)80079-0_bib15","unstructured":"N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, to appear."},{"key":"10.1016\/S0022-0000(05)80079-0_bib16","unstructured":"N. Robertson and P. D. Seymour, Graph minors. XVI. Wagners conjecture, to appear."},{"key":"10.1016\/S0022-0000(05)80079-0_bib17","unstructured":"C. P. Schnorr, Optimal algorithms for self-reducible problems in \u201cProceedings, 1976 International Conference on Automata, Programming and Languages,\u201d pp. 322\u2013337."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800790?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800790?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:44:47Z","timestamp":1552841087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800790"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80079-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}