{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:49Z","timestamp":1725467389322},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_106","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"469-486","source":"Crossref","is-referenced-by-count":0,"title":["A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Arnborg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, J. ACM 40 (1993), 1134\u20131164","journal-title":"J. ACM"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"308","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, J. of Algorithms 12, (1991), 308\u2013340","journal-title":"J. of Algorithms"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01994877","volume":"32","author":"S. Arnborg","year":"1992","unstructured":"S. Arnborg and A. Proskurowski, Canonical representations of partial 2-and 3-trees, BIT 32 (1992), 197\u2013214","journal-title":"BIT"},{"key":"32_CR4","unstructured":"S. Arnborg, A. Proskurowski, and D. Seese, Monadic second order logic, tree automata and forbidden minors, in Proceedings of the 4th Computer Science Logic Workshop, E.B\u00f6rger and H. Kleine Buning, Eds., Springer-Verlag LNCS 533, 1\u201316 (1991)"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83\u2013127","journal-title":"Mathematical Systems Theory"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, On reduction algorithms for graphs with small treewidth, Proc. 19th Workshop on Graph-Theoretic Concepts in Computer Science, Springer Verlag, LNCS 790, 45\u201356 (1993)","DOI":"10.1007\/3-540-57899-4_40"},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs, Information and Computation 85 (1990), 12\u201375","journal-title":"Information and Computation"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"B. Courcelle, The Monadic Second-Order Logic of Graphs III: Tree-Decompositions, Minors and Complexity Issues, Informatique Th\u00e9orique et Applications 26 (1992), 257\u2013286.","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1951","unstructured":"R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Mathematics 51 (1951), 161\u2013166","journal-title":"Ann. of Mathematics"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Graetzer, Universal Algebra, Springer Verlag, 1979","DOI":"10.1007\/978-0-387-77487-9"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(94)90021-3","volume":"54","author":"N. Kinnersley","year":"1994","unstructured":"N. Kinnersley and M. Langston, Obstruction set isolation for the gate matrix layout problem, Discrete Applied Mathematics 54, 169\u2013214 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(94)90022-1","volume":"54","author":"N.M. Korneyenko","year":"1994","unstructured":"N.M. Korneyenko, Combinatorial algorithms on a class of graphs, Discrete Applied Mathematics 54, 215\u2013218 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR13","unstructured":"D. Kozen, On the Myhill-Nerode theorem for trees, Bulletin of the EATCS 47, 170\u2013173"},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D. Rose","year":"1974","unstructured":"D. Rose, On simple characterization of k-trees, Discrete Mathematics 7, 317\u201322 (1974)","journal-title":"Discrete Mathematics"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, E. Lawler and R.E. Tarjan, The recognition of series-parallel digraphs, SIAM J. Computing 11, 298\u2013313 (1982)","journal-title":"SIAM J. Computing"},{"key":"32_CR16","unstructured":"A. Takahashi, S. Ueno, and Y. Kajitani, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, in Proceedings of SIGAL (1991)"},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"J.W. Thatcher and J.B. Write, Generalized finite automata theory with an application to a decision problem in second-order logic, Mathematical Systems Theory 2, 57\u201381 (1968).","journal-title":"Mathematical Systems Theory"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"A. Wald","year":"1983","unstructured":"A. Wald and C.J. Colbourn, Steiner Trees, Partial 2-trees, and minimum IFI networks, Networks 13, 159\u2013167 (1983).","journal-title":"Networks"},{"key":"32_CR19","volume-title":"PhD Thesis URI-030","author":"T.V. Wimer","year":"1988","unstructured":"T.V. Wimer, Linear algorithms on k-terminal graphs, PhD Thesis URI-030, Clemson University, Clemson (1988)."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T02:39:23Z","timestamp":1683513563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}