{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T18:40:06Z","timestamp":1742150406701,"version":"3.38.0"},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387970196"},{"type":"electronic","value":"9781461396475"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/978-1-4613-9647-5_5","type":"book-chapter","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T03:00:25Z","timestamp":1324954825000},"page":"37-45","source":"Crossref","is-referenced-by-count":1,"title":["Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Nancy G.","family":"Kinnersley","sequence":"additional","affiliation":[]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","first-page":"397","volume-title":"Proc. 25th Allerton Gonf. on Communication, Control and Computing","author":"RL Bryant","year":"1987","unstructured":"R. L. Bryant, M. R. Fellows, N. G. Kinnersley and M. A. Langston, \u201cOn Finding Obstruction Sets and Polynomial-Time Algorithms for Gate Matrix Layout,\u201dProc. 25th Allerton Gonf. on Communication, Control and Computing (1987), 397\u2013398."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","volume":"6","author":"N Deo","year":"1987","unstructured":"N. Deo, M. S. Krishnamoorthy and M. A., Langston, \u201cExact and Approximate Solutions for the Gate Matrix Layout Problem,\u201dIEEE Trans, on Computer-Aided Design 6 (1987), 79\u201384.","journal-title":"IEEE Trans, on Computer-Aided Design"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","volume":"26","author":"MR Fellows","year":"1987","unstructured":"M. R. Fellows and M. A. Langston, \u201cNonconstructive Advances in Polynomial Time Complexity,\u201dInfo. Proc. Letters 26 (1987), 157\u2013162.","journal-title":"Info. Proc. Letters"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"MR Fellows","year":"1988","unstructured":"M. R. Fellows and M. A. Langston, \u201cNonconstructive Tools for Proving PolynomialrTime Decidability,\u201dJ. of the ACM35 (1988), 727\u2013739.","journal-title":"J. of the ACM"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.7551\/mitpress\/1102.003.0025","volume-title":"Proc. 5th MIT Conf. on Advanced Research in VLSI","author":"MR Fellows","year":"1988","unstructured":"M. R. Fellows and M. A. Langston, \u201cLayout Permutation Problems and Well-Partially-Ordered Sets,\u201dProc. 5th MIT Conf. on Advanced Research in VLSI (1988) ,315\u2013327."},{"key":"5_CR6","volume-title":"Proc. 21st ACM Symp. on Theory of Computing","author":"MR Fellows","year":"1989","unstructured":"M. R. Fellows and M. A. Langston, \u201cOn Search, Decision and the Efficiency of Polynomial-Time Algorithms,\u201dProc. 21st ACM Symp. on Theory of Computing (1989)."},{"key":"5_CR7","unstructured":"H. Friedman, N. Robertson and P. D. Seymour, \u201cThe Metamathematics of the Graph Minor Theorem,\u201d inApplications of Logic to Combinatorics. American Math. Soc, Providence, RI, to appear."},{"key":"5_CR8","unstructured":"N. G. Kinnersley, \u201cObstruction Set Isolation for Layout Permutation Problems,\u201d Ph. D. Thesis, Washington State University, to appear."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"N. Robertson and P. D. Seymour, \u201cGraph Minors I. Excluding a Forest,\u201dJ. Comb. Th. Ser. B 35 (1983), 39\u201361.","journal-title":"J. Comb. Th. Ser. B"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"N. Robertson and P. D. Seymour, \u201cGraph Minors V. Excluding a Planar Graph,\u201dJ. Comb. Th. Ser. \u00a341 (1986), 92\u2013114.","journal-title":"J. Comb. Th. Ser."},{"key":"5_CR11","unstructured":"N. Robertson and P. D. Seymour, \u201cGraph Minors XIII. The Disjoint Paths Problem,\u201d to appear."},{"key":"5_CR12","unstructured":"N. Robertson and P. D. Seymour, \u201cGraph Minors XVI. Wagner\u2019s Conjecture,\u201d to appear."}],"container-title":["Computers and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4613-9647-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T18:08:31Z","timestamp":1742148511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4613-9647-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9780387970196","9781461396475"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4613-9647-5_5","relation":{},"subject":[],"published":{"date-parts":[[1989]]}}}