{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:46:46Z","timestamp":1771145206563,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80116-7","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"27-30","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["The algorithmic theory of treewidth"],"prefix":"10.1016","volume":"5","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80116-7_BIB1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K. R., and Fellows, M. R. Finite automata, bounded treewidth and well-quasiordering. In Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147 (1993), N. Robertson and P. Seymour, Eds., American Mathematical Society, pp. 539-564.","DOI":"10.1090\/conm\/147\/01199"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB2","article-title":"Fixed parameter algorithms For planar dominating set and related problems","author":"Alber","year":"2000","journal-title":"To appear in: Proceedings Scandinavian Workshop on Algorithm Theory, SWAT"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10.1016\/S1571-0653(05)80116-7_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for NP-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H. L. Treewidth: Algorithmic techniques and results. In Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, volume 1295 (Berlin, 1997), I. Privara and P. Ruzicka, Eds., Springer-Verlag, pp. 19-36.","DOI":"10.1007\/BFb0029946"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theor. Comp. Sc."},{"key":"10.1016\/S1571-0653(05)80116-7_BIB7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I: Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","article-title":"Subgraph isomorphism in planar graphs and related problems","volume":"3","author":"Eppstein","year":"1999","journal-title":"J. Graph Algorithms and Applications"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s004530010020","article-title":"Diameter and treewidth in minor-closed graph families","volume":"27","author":"Eppstein","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S1571-0653(05)80116-7_BIB10","unstructured":"Lapoire, D. Recognizability equals definability, for every set of graphs of bounded tree-width. In Proceedings 15th Annual Symposium on Theoretical Aspects of Computer Science (1998), Springer Verlag, Lecture Notes in Computer Science, vol. 1373, pp. 618-628."},{"key":"10.1016\/S1571-0653(05)80116-7_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T00:06:20Z","timestamp":1683072380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":11,"alternative-id":["S1571065305801167"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80116-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}