{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:41:04Z","timestamp":1773092464329,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027320705349","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"283-290","source":"Crossref","is-referenced-by-count":15,"title":["Necessary Edges in k-Chordalisations of Graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5149233_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, and A. Proskurowski, \u201cComplexity of finding embeddings in a k-tree,\u201d SIAM J. Alg. Disc. Meth., vol. 8, pp. 277-284, 1987.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"5149233_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, \u201cEasy problems for tree-decomposable graphs,\u201d J. Algorithms, vol. 12, pp. 308-340, 1991.","journal-title":"J. Algorithms"},{"key":"5149233_CR3","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender, \u201cA linear time algorithm for finding tree-decompositions of small treewidth,\u201d SIAM J. Comput., vol. 25, pp. 1305-1317, 1996.","journal-title":"SIAM J. Comput."},{"key":"5149233_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"H.L. Bodlaender, \u201cA partial k-arboretum of graphs with bounded treewidth,\u201d Theor. Comp. Sc., vol. 209, pp. 1-45, 1998.","journal-title":"Theor. Comp. Sc."},{"key":"5149233_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0166-218X(96)00057-1","volume":"71","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender and B. de Fluiter, \u201cOn intervalizing k-colored graphs for DNA physical mapping,\u201d Disc. Appl. Math., vol. 71, pp. 55-77, 1996.","journal-title":"Disc. Appl. Math."},{"key":"5149233_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0304-3975(98)00342-9","volume":"244","author":"H.L. Bodlaender","year":"2000","unstructured":"H.L. Bodlaender, M.R. Fellows, M.T. Hallett, H.T. Wareham, and T.J. Warnow, \u201cThe hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs,\u201d Theor. Comp. Sc., vol. 244, pp. 167-188, 2000.","journal-title":"Theor. Comp. Sc."},{"key":"5149233_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/jagm.1993.1035","volume":"15","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender and T. Kloks, \u201cA simple linear time algorithm for triangulating three-colored graphs,\u201d J. Algorithms, vol. 15, pp. 160-172, 1993.","journal-title":"J. Algorithms"},{"key":"5149233_CR8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender and T. Kloks, \u201cEfficient and constructive algorithms for the pathwidth and treewidth of graphs,\u201d J. Algorithms, vol. 21, pp. 358-402, 1996.","journal-title":"J. Algorithms"},{"key":"5149233_CR9","first-page":"32","volume-title":"Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence","author":"H.L. Bodlaender","year":"2001","unstructured":"H.L. Bodlaender, A.M.C.A. Koster, F. van den Eijkhof, and L.C. van der Gaag, \u201cPre-processing for triangulation of probabilistic networks,\u201d in Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, J. Breese and D. Koller (ed.), San Francisco, Morgan Kaufmann, pp. 32-39, 2001."},{"key":"5149233_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender and R.H. M\u00f6hring, \u201cThe pathwidth and treewidth of cographs,\u201d SIAM J. Disc. Math., vol. 6, pp. 181-188, 1993.","journal-title":"SIAM J. Disc. Math."},{"key":"5149233_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"B. Courcelle and M. Mosbah, \u201cMonadic second-order evaluations on tree-decomposable graphs,\u201d Theor. Comp. Sc., vol. 109, pp. 49-82, 1993.","journal-title":"Theor. Comp. Sc."},{"key":"5149233_CR12","doi-asserted-by":"crossref","unstructured":"H. Kaplan, R. Shamir, and R.E. Tarjan, \u201cTractability of parameterized completion problems on chordal and interval graphs,\u201d Found. Comput. Ser., pp. 780-791, 1994.","DOI":"10.1109\/SFCS.1994.365715"},{"key":"5149233_CR13","doi-asserted-by":"crossref","unstructured":"J. Lagergren and S. Arnborg, \u201cFinding minimal forbidden minors using a finite congruence,\u201d in Proceedings of the 18th International Colloquium on Automata, Languages and Programming, Springer Verlag, Lecture Notes in Computer Science, vol. 510, pp. 532-543, 1991.","DOI":"10.1007\/3-540-54233-7_161"},{"key":"5149233_CR14","doi-asserted-by":"crossref","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, \u201cGraph minors. II. Algorithmic aspects of tree-width,\u201d J. Algorithms, vol. 7, pp. 309-322, 1986.","journal-title":"J. Algorithms"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027320705349.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027320705349\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027320705349.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:44:08Z","timestamp":1751283848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027320705349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149233"],"URL":"https:\/\/doi.org\/10.1023\/a:1027320705349","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}