{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:47:31Z","timestamp":1725587251887},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_36","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"424-436","source":"Crossref","is-referenced-by-count":3,"title":["Constraint Satisfaction Parameterized by Solution Size"],"prefix":"10.1007","author":[{"given":"Andrei A.","family":"Bulatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"LNCS","first-page":"112","volume-title":"AAAI","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Wallace, M. (ed.) AAAI. LNCS, vol.\u00a03258, pp. 112\u2013117. Springer, Heidelberg (2004)"},{"key":"36_CR2","first-page":"321","volume-title":"LICS","author":"A. Bulatov","year":"2003","unstructured":"Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS, pp. 321\u2013330. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A.A. Bulatov","year":"2005","unstructured":"Bulatov, A.A., Jeavons, P., Krokhin, A.A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"36_CR4","first-page":"419","volume-title":"LICS","author":"A.A. Bulatov","year":"2009","unstructured":"Bulatov, A.A., Marx, D.: The complexity of global cardinality constraints. In: LICS, pp. 419\u2013428. IEEE Computer Society, Los Alamitos (2009)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-87531-4_10","volume-title":"Computer Science Logic","author":"N. Creignou","year":"2008","unstructured":"Creignou, N., Schnoor, H., Schnoor, I.: Non-uniform boolean constraint satisfaction problems with cardinality constraint. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 109\u2013123. Springer, Heidelberg (2008)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.Y.: Monotone monadic snp and constraint satisfaction. In: STOC, pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"key":"36_CR8","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. ACM\u00a044, 527\u2013548 (1997)","journal-title":"J. ACM"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1009890709297","volume":"4","author":"P. Jeavons","year":"1999","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: How to determine the expressive power of constraints. Constraints\u00a04, 113\u2013131 (1999)","journal-title":"Constraints"},{"issue":"6","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1137\/S0097539799349948","volume":"30","author":"S. Khanna","year":"2001","unstructured":"Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput.\u00a030(6), 1863\u20131920 (2001)","journal-title":"SIAM J. Comput."},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-14165-2_55","volume-title":"Automata, Languages and Programming","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Preprocessing of min ones problems: A dichotomy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 653\u2013665. Springer, Heidelberg (2010)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-540-70575-8_54","volume-title":"Automata, Languages and Programming","author":"A.A. Krokhin","year":"2008","unstructured":"Krokhin, A.A., Marx, D.: On the hardness of losing weight. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 662\u2013673. Springer, Heidelberg (2008)"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14","DOI":"10.1007\/s00037-005-0195-9"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-30201-8_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.C. R\u00e9gin","year":"2004","unstructured":"R\u00e9gin, J.C., Gomes, C.P.: The cardinality matrix constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 572\u2013587. Springer, Heidelberg (2004)"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Rosenberg, I.: Multiple-valued hyperstructures. In: ISMVL, pp. 326\u2013333 (1998)","DOI":"10.1109\/ISMVL.1998.679509"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-02777-2_27","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"S. Szeider","year":"2009","unstructured":"Szeider, S.: The parameterized complexity of k-flip local search for sat and max sat. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 276\u2013283. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:47:44Z","timestamp":1560289664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}