{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:54:27Z","timestamp":1752461667523},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666264"},{"type":"electronic","value":"9783540480853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48085-3_9","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T17:25:21Z","timestamp":1292520321000},"page":"118-128","source":"Crossref","is-referenced-by-count":6,"title":["Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Bj\u00e4reland","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","volume":"65","author":"M. Cooper","year":"1994","unstructured":"Cooper, M., Cohen, D., Jeavons, P.: Characterizing tractable constraints. Artificial Intelligence\u00a065, 347\u2013361 (1994)","journal-title":"Artificial Intelligence"},{"key":"9_CR2","volume-title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","author":"Y. Deville","year":"1997","unstructured":"Deville, Y., Barette, O., Van Hentenryck, P.: Constraint satisfaction over connected row convex constraints. In: Pollack, M.E. (ed.) Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan. Morgan Kaufmann, San Francisco (1997)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic snp and constraint satisfaction: a study through Datalog and group theory. SIAM Journal of Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"Freuder, E.C.: Synthesizing constraint expressions. Communications of the ACM\u00a021, 958\u2013966 (1978)","journal-title":"Communications of the ACM"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E.C. Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of the ACM\u00a029(1), 24\u201332 (1982)","journal-title":"Journal of the ACM"},{"key":"9_CR6","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, ser. B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, ser. B"},{"issue":"1-2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0004-3702(98)00022-8","volume":"101","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency, and closure. Artificial Intelligence\u00a0101(1-2), 251\u2013265 (1998)","journal-title":"Artificial Intelligence"},{"key":"9_CR8","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. Journal of the ACM\u00a044, 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"key":"9_CR9","unstructured":"Jeavons, P., Cohen, D., Pearson, J.: Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence (1999) (to appear)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P. Jeavons","year":"1996","unstructured":"Jeavons, P., Cooper, M.: Tractable constraints in ordered domains. Artificial Intelligence\u00a079, 327\u2013339 (1996)","journal-title":"Artificial Intelligence"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Symmetric complementation. In: Proceedings of the 14th ACM Symposium on Theory of Computing, pp. 210\u2013214 (1982)","DOI":"10.1145\/800070.802193"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ta-Schma, A.: Symmetric logspace is closed under complement. In: Proceedings of the 27th ACM Symposium on Theory of Computing, STOC 1995 (1995)","DOI":"10.1145\/225058.225101"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48085-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T16:23:34Z","timestamp":1553271814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48085-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666264","9783540480853"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48085-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}