{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:09Z","timestamp":1725470829834},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_36","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"499-513","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Satisfaction with Bounded Treewidth Revisited"],"prefix":"10.1007","author":[{"given":"Marko","family":"Samer","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"36_CR2","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. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR3","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11564751_15","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"H. Chen","year":"2005","unstructured":"Chen, H., Dalmau, V.: Beyond hypertree width: Decomposition methods without decompositions. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 167\u2013181. Springer, Heidelberg (2005)"},{"key":"36_CR5","volume-title":"Handbook of Constraint Programming","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, vol.\u00a08. Elsevier, Amsterdam (forthcoming, 2006)"},{"key":"36_CR6","unstructured":"Cohen, D., Jeavons, P., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In: Proc. IJCAI 2005, pp. 72\u201377 (2005)"},{"key":"36_CR7","volume-title":"Handbook of Constraint Programming, part\u00a0I","author":"R. Dechter","year":"2006","unstructured":"Dechter, R.: Tractable structures for constraint satisfaction problems. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, part\u00a0I, ch.\u00a07. Elsevier, Amsterdam (forthcoming, 2006)"},{"issue":"3","key":"36_CR8","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(3), 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"36_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"36_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"4","key":"36_CR11","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E.C. Freuder","year":"1985","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-bounded search. Journal of the ACM\u00a032(4), 755\u2013761 (1985)","journal-title":"Journal of the ACM"},{"key":"36_CR12","unstructured":"Ganzow, T., Gottlob, G., Musliu, N., Samer, M.: A CSP hypergraph library. Technical Report DBAI-TR-2005-50, Database and Artificial Intelligence Group, Vienna University of Technology (2005)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11604686_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Grohe, M., Musliu, N., Samer, M., Scarcello, F.: Hypertree decompositions: Structure, algorithms, and applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-44683-4_5","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions: a survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 37\u201357. Springer, Heidelberg (2001)"},{"issue":"3","key":"36_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"J. of Computer and System Sciences"},{"issue":"1-2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","volume":"138","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Scarcello, F., Sideri, M.: Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence\u00a0138(1-2), 55\u201386 (2002)","journal-title":"Artificial Intelligence"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/1109557.1109590","volume-title":"Proc. SODA 2006","author":"M. Grohe","year":"2006","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. SODA 2006, pp. 289\u2013298. ACM, New York (2006)"},{"issue":"2","key":"36_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. J. of Computer and System Sciences\u00a061(2), 302\u2013332 (2000)","journal-title":"J. of Computer and System Sciences"},{"key":"36_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"3","key":"36_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1006\/jcss.1999.1626","volume":"58","author":"C.H. Papadimitriou","year":"1999","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. J. of Computer and System Sciences\u00a058(3), 407\u2013427 (1999)","journal-title":"J. of Computer and System Sciences"},{"key":"36_CR21","first-page":"221","volume-title":"Proc. STOC 1992","author":"B. Reed","year":"1992","unstructured":"Reed, B.: Finding approximate separators and computing tree width quickly. In: Proc. STOC 1992, pp. 221\u2013228. ACM, New York (1992)"},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 188\u2013202. Springer, Heidelberg (2004)"}],"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_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:30:36Z","timestamp":1619494236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11889205_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}