{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:53Z","timestamp":1794527813886,"version":"4.9.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_20","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"298-315","source":"Crossref","is-referenced-by-count":8,"title":["Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size"],"prefix":"10.1007","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanan","family":"Kanso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"20_CR1","unstructured":"de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted CSP. In Proceedings of AAAI, pp. 22\u201327 (2006)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: A graph theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Graph Theory and Computing, pp. 183\u2013217. Academic Press (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"20_CR3","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers, San Francisco (2003)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-642-15396-9_7","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"D Allouche","year":"2010","unstructured":"Allouche, D., de Givry, S., Schiex, T.: Towards parallel non serial dynamic programming for solving hard weighted CSP. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 53\u201360. Springer, Heidelberg (2010)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Kanso, H., Terrioux, C.: An algorithmic framework for decomposing constraint networks. In: Proceedings of ICTAI, pp. 1\u20138 (2015)","DOI":"10.1109\/ICTAI.2015.15"},{"key":"20_CR6","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI, pp. 146\u2013150 (2004)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-540-74970-7_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"P J\u00e9gou","year":"2007","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Dynamic management of heuristics for solving structured CSPs. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 364\u2013378. Springer, Heidelberg (2007)"},{"key":"20_CR10","unstructured":"J\u00e9gou, P., Terrioux, C.: Combining restarts, nogoods and decompositions for solving CSPs. In: Proceedings of ECAI, pp. 465\u2013470 (2014)"},{"key":"20_CR11","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, New York (2006)"},{"key":"20_CR12","doi-asserted-by":"crossref","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. Artif. Intell. 124, 243\u2013282 (2000)","journal-title":"Artif. Intell."},{"key":"20_CR13","doi-asserted-by":"crossref","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 treewidth. Algorithms 7, 309\u2013322 (1986)","journal-title":"Algorithms"},{"key":"20_CR14","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. Elsevier, New York (1973)"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"C Cabon","year":"1999","unstructured":"Cabon, C., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency. Constraints 4, 79\u201389 (1999)","journal-title":"Constraints"},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskuroswki, A.: Complexity of finding embeddings in a k-tree. SIAM J. Disc. Math. 8, 277\u2013284 (1987)","journal-title":"SIAM J. Disc. Math."},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3709, pp. 777\u2013781. Springer, Heidelberg (2005)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-319-10428-7_31","volume-title":"Principles and Practice of Constraint Programming","author":"P J\u00e9gou","year":"2014","unstructured":"J\u00e9gou, P., Terrioux, C.: Tree-decompositions with connected clusters for solving constraint networks. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 407\u2013423. Springer, Heidelberg (2014)"},{"key":"20_CR19","doi-asserted-by":"crossref","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. Artif. Intell. 146, 43\u201375 (2003)","journal-title":"Artif. Intell."},{"key":"20_CR20","unstructured":"Li, W., van Beek, P.: Guiding Real-World SAT solving with dynamic hypergraph separator decomposition. In: Proceedings of ICTAI, pp. 542\u2013548 (2004)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","first-page":"125","volume-title":"Principles and Practice of Constraint Programming","author":"D Sabin","year":"1994","unstructured":"Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfaction. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 125\u2013129. Springer, Heidelberg (1994)"},{"issue":"3\u20134","key":"20_CR23","first-page":"147","volume":"1","author":"C Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Recording and minimizing nogoods from restarts. JSAT 1(3\u20134), 147\u2013167 (2007)","journal-title":"JSAT"},{"key":"20_CR24","first-page":"3","volume":"2","author":"C Lecoutre","year":"2008","unstructured":"Lecoutre, C., Likitvivatanavong, C., Shannon, S., Yap, R., Zhang, Y.: Maintaining arc consistency with multiple residues. Constraint Program. Lett. 2, 3\u201319 (2008)","journal-title":"Constraint Program. Lett."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:52Z","timestamp":1498324072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_20","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}