{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:16:57Z","timestamp":1725603417295},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"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-23786-7_42","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"546-560","source":"Crossref","is-referenced-by-count":6,"title":["QCSP on Partially Reflexive Forests"],"prefix":"10.1007","author":[{"given":"Barnaby","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(87)90058-8","volume":"16","author":"H.J. Bandelt","year":"1987","unstructured":"Bandelt, H.J., Dhlmann, A., Schtte, H.: Absolute retracts of bipartite graphs. Discrete Applied Mathematics\u00a016(3), 191\u2013215 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0195-6698(89)80053-8","volume":"10","author":"H.-J. Bandelt","year":"1989","unstructured":"Bandelt, H.-J., Pesch, E.: Dismantling absolute retracts of reflexive graphs. Eur. J. Comb.\u00a010, 211\u2013220 (1989)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"42_CR3","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1137\/070708093","volume":"38","author":"L. Barto","year":"2009","unstructured":"Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing\u00a038(5), 1782\u20131802 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"42_CR4","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.ic.2009.05.003","volume":"207","author":"F. B\u00f6rner","year":"2009","unstructured":"B\u00f6rner, F., Bulatov, A.A., Chen, H., Jeavons, P., Krokhin, A.A.: The complexity of constraint satisfaction games and qcsp. Inf. Comput.\u00a0207(9), 923\u2013944 (2009)","journal-title":"Inf. Comput."},{"key":"42_CR5","unstructured":"B\u00f6rner, F., Krokhin, A., Bulatov, A., and Jeavons, P. Quantified constraints and surjective polymorphisms. Tech. Rep. PRG-RR-02-11, Oxford University (2002)"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"J. ACM"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034, 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"42_CR8","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/060668572","volume":"37","author":"H. Chen","year":"2008","unstructured":"Chen, H.: The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case. SIAM J. Comput.\u00a037(5), 1674\u20131701 (2008)","journal-title":"SIAM J. Comput."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Madelaine, F., Martin, B.: Quantified constraints and containment problems. In: 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 317\u2013328 (2008)","DOI":"10.1109\/LICS.2008.15"},{"issue":"4","key":"42_CR10","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.ejc.2007.11.020","volume":"29","author":"V. Dalmau","year":"2008","unstructured":"Dalmau, V., Krokhin, A.A.: Majority constraints have bounded pathwidth duality. Eur. J. Comb.\u00a029(4), 821\u2013837 (2008)","journal-title":"Eur. J. Comb."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","unstructured":"Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing\u00a028, 57\u2013104 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Science \u2013 Theory and Applications","author":"P. Golovach","year":"2011","unstructured":"Golovach, P., Paulusma, D., Song, J.: Computing vertex-surjective homomorphisms to partially reflexive trees. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651. Springer, Heidelberg (to appear, 2011)"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/11780342_36","volume-title":"Logical Approaches to Computational Barriers","author":"B. Martin","year":"2006","unstructured":"Martin, B., Madelaine, F.: Towards a trichotomy for quantified H-coloring. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 342\u2013352. Springer, Heidelberg (2006)"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45477-2_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Patrignani","year":"2001","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the matching-cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 284\u2013295. Springer, Heidelberg (2001)"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:18:52Z","timestamp":1554135532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}