{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:30Z","timestamp":1725470850294},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_62","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"741-745","source":"Crossref","is-referenced-by-count":4,"title":["An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP"],"prefix":"10.1007","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence\u00a0124, 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Algorithms"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/11564751_63","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P. J\u00e9gou","year":"2005","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Computing and exploiting tree-decompositions for solving constraint networks. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 777\u2013781. Springer, Heidelberg (2005)"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P. J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence\u00a0146, 43\u201375 (2003)","journal-title":"Artificial Intelligence"},{"key":"62_CR6","unstructured":"Gottlob, G., Hutle, M., Wotawa, F.: Combining hypertree, bicomp and hinge decomposition. In: Proceedings of ECAI, pp. 161\u2013165 (2002)"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Strategies and heuristics for exploiting tree-decompositions of constraint networks. In: Proceedings of WIGSK (2006)","DOI":"10.1007\/11564751_63"},{"key":"62_CR8","unstructured":"Smith, B.: The Phase Transition and the Mushy Region in Constraint Satisfaction Problems. In: Proceedings of ECAI, pp. 100\u2013104 (1994)"},{"issue":"3","key":"62_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013 (3), 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:32Z","timestamp":1605642692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11889205_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}