{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:29:17Z","timestamp":1757626157444,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0167-9260(91)90028-j","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"321-337","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast search algorithms for layout permutation problems"],"prefix":"10.1016","volume":"12","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(91)90028-J_BIB1","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths\u2014a survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0167-9260(91)90028-J_BIB2","series-title":"Surveys in Combinatorics","first-page":"153","article-title":"Graph minors\u2014a survey","author":"Robertson","year":"1985"},{"key":"10.1016\/0167-9260(91)90028-J_BIB3","unstructured":"N. Robertson and P.D. Seymour, Graph minors IV. Tree-width and well-quasi-ordering, J. Comb. Th. Ser. B, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB4","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":"B41","author":"Robertson","year":"1986","journal-title":"J. Comb. Th. Ser."},{"key":"10.1016\/0167-9260(91)90028-J_BIB5","unstructured":"N. Robertson and P.D. Seymour, Graph minors X. Obstructions to tree-decomposition, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB6","unstructured":"N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB7","unstructured":"N. Robertson and P.D. Seymour, Graph minors XVI. Wagner's conjecture, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB8","first-page":"157","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987"},{"key":"10.1016\/0167-9260(91)90028-J_BIB9","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving lynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0167-9260(91)90028-J_BIB10","series-title":"Proc. 5th MIT Conf. Advanced Research in VLSI","first-page":"315","article-title":"Layout permutation problems and well-partially-ordered sets","author":"Fellows","year":"1988"},{"key":"10.1016\/0167-9260(91)90028-J_BIB11","unstructured":"M.R. Fellows and M.A. Langston, On well-partial-order theory and its application to combinatorial problems of VLSI design, to appear."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0167-9260(91)90028-J_BIB12"},{"key":"10.1016\/0167-9260(91)90028-J_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207168908803783","article-title":"Polynomial-time self-reducibility: theoretical motivations and practical results","volume":"31","author":"Brown","year":"1989","journal-title":"Int. J. of Comp. Math."},{"key":"10.1016\/0167-9260(91)90028-J_BIB14","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/BFb0036931","article-title":"On minimizing width in linear layouts","volume":"154","author":"Makedon","year":"1983","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0167-9260(91)90028-J_BIB15","series-title":"Proc. 21st ACM Symp. Theory of Computing","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989"},{"key":"10.1016\/0167-9260(91)90028-J_BIB16","series-title":"PhD Thesis","article-title":"Obstruction set isolation for layout permutation problems","author":"Kinnersley","year":"1989"},{"key":"10.1016\/0167-9260(91)90028-J_BIB17","unstructured":"P.D. Seymour, private communication."},{"key":"10.1016\/0167-9260(91)90028-J_BIB18","unstructured":"H.L. Bodlaender, Improved self-reduction algorithms for graphs with bounded tree-width, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/mana.19720530113","article-title":"Hinreichende Bedingungen f\u00fcr die Existenz von Teilgraphen, die zu einem vollst\u00e4ndigen Graphen hom\u00f6omorph sind","volume":"53","author":"Mader","year":"1972","journal-title":"Math. Nachr."},{"key":"10.1016\/0167-9260(91)90028-J_BIB20","unstructured":"J. Ellis, I.H. Sudborough and J. Turner, Graph separation and search number, to appear."},{"key":"10.1016\/0167-9260(91)90028-J_BIB21","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\/0167-9260(91)90028-J_BIB22","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black-white pebbles and graph separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/0167-9260(91)90028-J_BIB23","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/0167-9260(91)90028-J_BIB24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Computer Science"},{"year":"1973","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","key":"10.1016\/0167-9260(91)90028-J_BIB25"},{"key":"10.1016\/0167-9260(91)90028-J_BIB26","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probleme des curbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190028J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190028J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:35Z","timestamp":1757453855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609190028J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["016792609190028J"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(91)90028-j","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1991,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast search algorithms for layout permutation problems","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(91)90028-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}