{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:55Z","timestamp":1725664555751},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:20Z","timestamp":1330278800000},"page":"415-427","source":"Crossref","is-referenced-by-count":1,"title":["Obstructions to within a few vertices or edges of acyclic"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Cattell","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Dinneen","sequence":"additional","affiliation":[]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BFb0019428","volume":"831","author":"K. Cattell","year":"1994","unstructured":"K. Cattell and M. J. Dinneen. A characterizatioa of graphs with vertex cover up to five. International Workshop on Orders, Algorithms, and Applications Proceedings (ORDAL'94), Springer-Verlag Lecture Notes in Computer Science, vol. 831, (1994), 86\u201399.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J. Ellis","year":"1994","unstructured":"J. Ellis, I. H. Sudborough, and J. Turner. The vertex separation and and search number of a graph. Information and Computation 113 (1994), 50\u201379.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"M. R. Fellows and M. A. Langston. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. Proc. Symposium on the Foundations of Computer Science (FOCS), IEEE Press (1989), 520\u2013525.","key":"36_CR3","DOI":"10.1109\/SFCS.1989.63528"},{"unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.","key":"36_CR4"},{"unstructured":"N. G. Kinnersley and M. A. Langston. Obstruction set isolation for the Gate Matrix Layout problem. Technical Report TR-91-5, Dept. of Computer Science, University of Kansas, January 1991, to appear Annals of Discrete Math.","key":"36_CR5"},{"doi-asserted-by":"crossref","unstructured":"J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. Proc. 18th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, Lecture Notes in Computer Science vol. 510 (1991), 533\u2013543.","key":"36_CR6","DOI":"10.1007\/3-540-54233-7_161"},{"doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, MIT Press, 1990.","key":"36_CR7","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"unstructured":"N. Robertson and P. D. Seymour. Graph minors XVI: Wagner's conjecture. to appear.","key":"36_CR8"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:14Z","timestamp":1605646574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}