{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:59Z","timestamp":1759637579227},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_153","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:34:02Z","timestamp":1330292042000},"page":"199-208","source":"Crossref","is-referenced-by-count":8,"title":["Reduction algorithms for constructing solutions in graphs with small treewidth"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Babette","family":"Fluiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539\u2013564. American Mathematical Society, 1993.","DOI":"10.1090\/conm\/147\/01199"},{"key":"21_CR2","doi-asserted-by":"publisher","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:1134\u20131164, 1993.","journal-title":"J. ACM"},{"key":"21_CR3","doi-asserted-by":"publisher","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. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308\u2013340, 1991.","journal-title":"J. Algorithms"},{"key":"21_CR4","first-page":"1","volume":"11","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1\u201323, 1993.","journal-title":"Acta Cybernetica"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender. On reduction algorithms for graphs with small treewidth. In Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, pages 45\u201356, 1994.","DOI":"10.1007\/3-540-57899-4_40"},{"key":"21_CR6","series-title":"Technical Report","volume-title":"Reduction algorithms for graphs with small treewidth","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender and B. de Fluiter. Reduction algorithms for graphs with small treewidth. Technical Report UU-CS-1995-37, Department of Computer Science, Utrecht University, Utrecht, 1995."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science 944","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-60084-1_80","volume-title":"Parallel algorithms with optimal speedup for bounded treewidth","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. F\u00fcl\u00f6p and F. G\u00e9cseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268\u2013279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R. B. Borie","year":"1992","unstructured":"R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555\u2013581, 1992.","journal-title":"Algorithmica"},{"key":"21_CR9","first-page":"192","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. Graph rewriting: an algebraic and logical approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 192\u2013242, Amsterdam, 1990. North Holland Publ. Comp."},{"key":"21_CR10","doi-asserted-by":"publisher","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:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309\u2013322, 1986.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:33Z","timestamp":1619573493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_153","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}