{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:28Z","timestamp":1725548908059},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_9","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"110-120","source":"Crossref","is-referenced-by-count":6,"title":["The Core of a Countably Categorical Structure"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","volume":"165","author":"D. Achlioptas","year":"1997","unstructured":"Achlioptas, D.: The complexity of G-free colourability. Discrete Mathematics\u00a0165, 21\u201330 (1997)","journal-title":"Discrete Mathematics"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Adeleke, S., Neumann, P.M.: Structure of partially ordered sets with transitive automorphism groups. AMS Memoir\u00a057(334) (1985)","DOI":"10.1090\/memo\/0334"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A. Aho","year":"1981","unstructured":"Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"9_CR4","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(94)00191-K","volume":"138","author":"B. Bauslaugh","year":"1995","unstructured":"Bauslaugh, B.: Core-like properties of infinite graphs and structures. Disc. Math.\u00a0138(1), 101\u2013111 (1995)","journal-title":"Disc. Math."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jctb.1996.0068","volume":"68","author":"B. Bauslaugh","year":"1996","unstructured":"Bauslaugh, B.: Cores and compactness of infinite directed graphs. Journal of Combinatorial Theory, Series B\u00a068(2), 255\u2013276 (1996)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9_CR7","unstructured":"Bodirsky, M.: Constraint satisfaction with infinite domains. Dissertation an der Humboldt-Universit\u00e4t zu Berlin (2004)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-45841-7_23","volume-title":"STACS 2002","author":"M. Bodirsky","year":"2002","unstructured":"Bodirsky, M., Kutz, M.: Pure dominance constraints. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 287\u2013298. Springer, Heidelberg (2002)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45220-1_5","volume-title":"Computer Science Logic","author":"M. Bodirsky","year":"2003","unstructured":"Bodirsky, M., Ne\u0161et\u0159il, J.: Constraint satisfaction with countable homogeneous templates. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 44\u201357. Springer, Heidelberg (2003)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321\u2013330 (2003)","DOI":"10.1109\/LICS.2003.1210072"},{"key":"9_CR11","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras (2003) (submitted)"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"crossref","unstructured":"Cameron, P.J.: The random graph. In: Graham, R.L., Ne\u0161et\u0159il, J. (eds.) The Mathematics of Paul Erd\u00f5s (1996)","DOI":"10.1007\/978-3-642-60406-5_32"},{"key":"9_CR14","volume-title":"Model theory","author":"Chang","year":"1977","unstructured":"Chang, Keisler: Model theory. Princeton University Press, Princeton (1977)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Cherlin, G.: The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. AMS Memoir\u00a0131(621) (January 1998)","DOI":"10.1090\/memo\/0621"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Cornell, T.: On determining the consistency of partial descriptions of trees. In: Proceedings of the ACL, pp. 163\u2013170 (1994)","DOI":"10.3115\/981732.981755"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Droste, M.: Structure of partially ordered sets with transitive automorphism groups. AMS Memoir\u00a057(334) (1985)","DOI":"10.1090\/memo\/0334"},{"key":"9_CR18","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":"9_CR19","unstructured":"Garey, M., Johnson, D.: A guide to NP-completeness. CSLI Press (1978)"},{"key":"9_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences. Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences. Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0012-365X(92)90282-K","volume":"109","author":"P. Hell","year":"1992","unstructured":"Hell, P., Nesetril, J.: The core of a graph. Discrete Math.\u00a0109, 117\u2013126 (1992)","journal-title":"Discrete Math."},{"key":"9_CR22","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":"9_CR23","volume-title":"A shorter model theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"9_CR24","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"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/876638.876639","volume":"50","author":"P. Jeavons","year":"2003","unstructured":"Jeavons, P., Jonsson, P., Krokhin, A.A.: Reasoning about temporal relations: The tractable subalgebras of Allen\u2019s interval algebra. JACM\u00a050(5), 591\u2013640 (2003)","journal-title":"JACM"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Lachlan, A.H.: Stable finitely homogeneous structures: A survey. In: Algebraic Model Theory. NATO ASI Series, vol.\u00a0496, pp. 145\u2013159 (1996)","DOI":"10.1007\/978-94-015-8923-9_6"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. JACM\u00a042(1), 43\u201366 (1995)","journal-title":"JACM"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Schaeffer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative charaters and subtrees. Journal of Classification\u00a09, 91\u2013116 (1992)","journal-title":"Journal of Classification"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:56Z","timestamp":1605742196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}