{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:51Z","timestamp":1725663591735},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_86","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:48Z","timestamp":1330257348000},"page":"359-370","source":"Crossref","is-referenced-by-count":0,"title":["Finite automata as characterizations of minor closed tree families (extended abstract)"],"prefix":"10.1007","author":[{"given":"Arvind","family":"Gupta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"crossref","first-page":"308ff","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. Journal of Algorithms, 12(2):308ff, 1991.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"30_CR2","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M. Fellows","year":"1988","unstructured":"M. Fellows and M. Langston. Nonconstructive tools for proving polynomial-time decidability. Journal of the Association for Computing Machinery, 35(3):727\u2013739, July 1988.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"M. Fellows and M. Langston. On search, decision and the efficiency of polynomial-time algorithms. In 21st ACM Symposium on Theory of Computing, pages 501\u2013512, 1989.","DOI":"10.1145\/73007.73055"},{"key":"30_CR4","volume-title":"PhD thesis","author":"A. Gupta","year":"1990","unstructured":"A. Gupta. Constructivity Issues in Tree Minors. PhD thesis, Dept. of Computer Science, University of Toronto, Toronto, Canada, 1990. Also Appears as Technical Report 244\/90, Dept. of Computer Science, University of Toronto."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"A. Gupta and R. Impagliazzo. Computing planar intertwines. In 32nd Symposium on the Foundations of Computer Science, pages 802\u2013811, 1991.","DOI":"10.1109\/SFCS.1991.185452"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"C. Kuratowski. Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math., 15:271\u2013283, 1930.","journal-title":"Fund. Math."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"J. Lagergren. Efficient parallel algorithms for tree-decompositions and related problems. In 31th Symposium on Foundations of Computer Science, pages 173\u2013181, 1990.","DOI":"10.1109\/FSCS.1990.89536"},{"key":"30_CR8","unstructured":"N. Robertson. Personal communication, 1990."},{"key":"30_CR9","unstructured":"N. Robertson and P. Seymour. Graph Minors XV. Wagner's conjecture. in preparation."},{"key":"30_CR10","unstructured":"N. Robertson, P. Seymour, and R. Thomas. Lower ideals of tree-structures. in preperation, 1991."},{"key":"30_CR11","unstructured":"P. Seymour and R. Thomas, 1991. Personal communication."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:41Z","timestamp":1619571461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}