{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:22Z","timestamp":1725497242177},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_77","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:31:09Z","timestamp":1196922669000},"page":"893-903","source":"Crossref","is-referenced-by-count":3,"title":["Weighted Treewidth Algorithmic Techniques and Results"],"prefix":"10.1007","author":[{"given":"Emgad","family":"Bachoore","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"77_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth.\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"77_CR2","series-title":"Lecture Notes in Computer Science","first-page":"217","volume-title":"Experimental and Efficient Algorithms","author":"E.H. Bachoore","year":"2005","unstructured":"Bachoore, E.H., Bodlaender, H.L.: New upper bound heuristics for treewidth. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 217\u2013227. Springer, Heidelberg (2005)"},{"key":"77_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume-title":"Algorithmic Aspects in Information and Management","author":"E.H. Bachoore","year":"2006","unstructured":"Bachoore, E.H., Bodlaender, H.L.: A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 255\u2013266. Springer, Heidelberg (2006)"},{"key":"77_CR4","unstructured":"Bachoore, E.H., Bodlaender, H.L.: Weighted treewidth. algorithmic techniques and results. Technical Report UU-CS-2006-012, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2006) Available at \n                    \n                      http:\/\/www.cs.uu.nl\/people\/bachoore"},{"key":"77_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc.\u00a0209, 1\u201345 (1998)","journal-title":"Theor. Comp. Sc."},{"issue":"3","key":"77_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1111\/j.1467-8640.2005.00274.x","volume":"21","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence\u00a021(3), 286\u2013305 (2005)","journal-title":"Computational Intelligence"},{"key":"77_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-36379-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Eijkhof van den","year":"2002","unstructured":"van den Eijkhof, F., Bodlaender, H.L.: Safe reduction rules for weighted treewidth. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 176\u2013185. Springer, Heidelberg (2002)"},{"key":"77_CR8","unstructured":"van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica (to appear)"},{"key":"77_CR9","series-title":"Statistics for Engineering and Information Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3502-4","volume-title":"Bayesian Networks and Decision Graphs","author":"F.V. Jensen","year":"2001","unstructured":"Jensen, F.V.: Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science. Springer, New York (2001)"},{"key":"77_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.J. Lauritzen","year":"1988","unstructured":"Lauritzen, S.J., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological)\u00a050, 157\u2013224 (1988)","journal-title":"The Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"77_CR11","volume-title":"Probablistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probablistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto (1988)"},{"key":"77_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/S0895480195280010","volume":"10","author":"S. Ramachandramurthi","year":"1997","unstructured":"Ramachandramurthi, S.: The structure and number of obstructions to treewidth. SIAM J. Disc. Math.\u00a010, 146\u2013157 (1997)","journal-title":"SIAM J. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:29Z","timestamp":1619506889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_77","relation":{},"subject":[]}}