{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:59:53Z","timestamp":1649062793218},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0012-365x(97)00147-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"191-196","source":"Crossref","is-referenced-by-count":10,"title":["On algorithmic applications of the immersion order"],"prefix":"10.1016","volume":"182","author":[{"given":"Michael A.","family":"Langston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara C.","family":"Plaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00147-7_BIB1","first-page":"481","article-title":"Algorithmic implications of the graph minor theorem","author":"Bienstock","year":"1995"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB2","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","author":"Bodlaender","year":"1992"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB3","article-title":"Sequential and parallel algorithms for K4 immersion testing","author":"Booth","year":"1995"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB4","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0222061","article-title":"Random self-reducibility of complete sets","volume":"22","author":"Feigenbaum","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(97)00147-7_BIB5","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. ACM"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB6","first-page":"325","article-title":"Fast search algorithms for layout permutation problems","volume":"3","author":"Fellows","year":"1991","journal-title":"Internat. J. Comput. Aided VLSI Design"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0405010","article-title":"On well-partial-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\/S0012-365X(97)00147-7_BIB8","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/S0022-0000(05)80079-0","article-title":"On search, decision and the efficiency of polynomial-time algorithms","volume":"49","author":"Fellows","year":"1994","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0012-365X(97)00147-7_BIB9","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB10","unstructured":"R. Govindan, private communication."},{"key":"10.1016\/S0012-365X(97)00147-7_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1988","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0012-365X(97)00147-7_BIB12","series-title":"Proc. 27th ACM\/IEEE Design Automation Conf.","first-page":"620","article-title":"Logic synthesis for programmable gate arrays","author":"Murgai","year":"1990"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB13","article-title":"Algorithms for VLSI layout based on graph width metrics","author":"Ramachandramurthi","year":"1994"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII. The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(97)00147-7_BIB15","unstructured":"N. Robertson, P.D. Seymour, Graph minors XXIII. The Nash-Williams immersion conjecture, to appear."},{"key":"10.1016\/S0012-365X(97)00147-7_BIB16","series-title":"Proc. 1976 Internat. Conf. on Automata, Programming and Languages","first-page":"322","article-title":"Optimal algorithms for self-reducible problems","author":"Schnorr","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001477?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:48Z","timestamp":1556277768000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0012365X97001477"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00147-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}