{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:05Z","timestamp":1725562925115},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_16","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"162-173","source":"Crossref","is-referenced-by-count":3,"title":["Distance Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Dalmau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Pinsker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","first-page":"1","volume":"3","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M.: Cores of countably categorical structures. Logical Methods in Computer Science (LMCS)\u00a03(1), 1\u201316 (2007), doi:10.2168\/LMCS-3(1:2)","journal-title":"Logical Methods in Computer Science (LMCS)"},{"doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Chen, H., Pinsker, M.: The reducts of equality up to primitive positive interdefinability. To appear in the Journal of Symbolic Logic (2010)","key":"16_CR2","DOI":"10.2178\/jsl\/1286198146"},{"doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Dalmau, V., Martin, B., Pinsker, M.: Distance constraint satisfaction problems. CoRR, abs\/1004.3842 (2010)","key":"16_CR3","DOI":"10.1007\/978-3-642-15155-2_16"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70583-3_16","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2008","unstructured":"Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 184\u2013196. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Hils, M., Martin, B.: On the scope of the universal-algebraic approach to constraint satisfaction. In: Proceedings of LICS 2010 (2010)","key":"16_CR5","DOI":"10.1109\/LICS.2010.13"},{"doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems complexity of temporal constraint satisfaction problems. Journal of the ACM\u00a057(2) (2009);","key":"#cr-split#-16_CR6.1","DOI":"10.1145\/1667053.1667058"},{"unstructured":"An extended abstract appeared in the proceedings of STOC 2008","key":"#cr-split#-16_CR6.2"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/logcom\/exi083","volume":"16","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., Ne\u0161et\u0159il, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation\u00a016(3), 359\u2013373 (2006)","journal-title":"Journal of Logic and Computation"},{"key":"16_CR8","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"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549809","volume-title":"Oligomorphic Permutation Groups","author":"P.J. Cameron","year":"1990","unstructured":"Cameron, P.J.: Oligomorphic Permutation Groups. Cambridge Univ. Press, Cambridge (1990)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]","year":"2008","unstructured":"Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.): Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. LNCS, vol.\u00a05250. Springer, Heidelberg (2008)"},{"key":"16_CR11","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, New York (2005)","edition":"3"},{"key":"16_CR12","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":"16_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198529804.001.0001","volume-title":"A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)","author":"S. Hedman","year":"2004","unstructured":"Hedman, S.: A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic). Oxford University Press, Inc., New York (2004)"},{"key":"16_CR14","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":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"16_CR16","volume-title":"A shorter model theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)"},{"issue":"1-2","key":"16_CR17","first-page":"251","volume":"101","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. AI\u00a0101(1-2), 251\u2013265 (1998)","journal-title":"AI"},{"issue":"4","key":"16_CR18","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. JACM\u00a044(4), 527\u2013548 (1997)","journal-title":"JACM"},{"key":"16_CR19","volume-title":"Model Theory: An Introduction","author":"D. Marker","year":"2002","unstructured":"Marker, D.: Model Theory: An Introduction. Springer, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: STOC, pp. 376\u2013385 (2005)","key":"16_CR20","DOI":"10.1145\/1060590.1060647"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T13:33:03Z","timestamp":1636119183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}