{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:37Z","timestamp":1725471517431},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_3","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T06:16:13Z","timestamp":1161152173000},"page":"27-36","source":"Crossref","is-referenced-by-count":4,"title":["Generalised Dualities and Finite Maximal Antichains"],"prefix":"10.1007","author":[{"given":"Jan","family":"Foniok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Tardif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.7151\/dmgt.1205","volume":"23","author":"J. Ne\u0161et\u0159il","year":"2003","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. Graph Theory\u00a023, 325\u2013332 (2003)","journal-title":"Discuss. Math. Graph Theory"},{"key":"3_CR2","series-title":"Oxford Lecture Series in Mathematics and Its Applications","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 Lecture Series in Mathematics and Its Applications, vol.\u00a028. Oxford University Press, Oxford (2004)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1992","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. J. Combin. Theory Ser. B\u00a048, 92\u2013119 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"3_CR4","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 J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"3_CR5","volume-title":"Handbook of Constraint Programming","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"3_CR6","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 J. Comput.\u00a028, 57\u2013104 (1998)","journal-title":"SIAM J. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1090\/S0002-9947-96-01537-1","volume":"348","author":"P. Hell","year":"1996","unstructured":"Hell, P., Ne\u0161et\u0159il, J., Zhu, X.: Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc.\u00a0348, 1281\u20131297 (1996)","journal-title":"Trans. Amer. Math. Soc."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(78)90062-6","volume":"22","author":"J. Ne\u0161et\u0159il","year":"1978","unstructured":"Ne\u0161et\u0159il, J., Pultr, A.: On classes of relations and graphs determined by subobjects and factorobjects. Discrete Math.\u00a022, 287\u2013300 (1978)","journal-title":"Discrete Math."},{"key":"3_CR9","unstructured":"Kom\u00e1rek, P.: Good characterisations in the class of oriented graphs. PhD thesis, Czechoslovak Academy of Sciences, Prague (1987) (in Czech)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2000.1970","volume":"80","author":"J. Ne\u0161et\u0159il","year":"2000","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). J. Combin. Theory Ser. B\u00a080(1), 80\u201397 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0304-3975(82)90129-3","volume":"17","author":"E. Welzl","year":"1982","unstructured":"Welzl, E.: Color families are dense. Theoret. Comput. Sci.\u00a017, 29\u201341 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S0305004100074806","volume":"120","author":"J. Ne\u0161et\u0159il","year":"1996","unstructured":"Ne\u0161et\u0159il, J., Zhu, X.: Path homomorphisms. Math. Proc. Cambridge Philos. Soc.\u00a0120, 207\u2013220 (1996)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems (submitted, 2006)","DOI":"10.2168\/LMCS-3(4:6)2007"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/LICS.2005.31","volume-title":"Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005)","author":"A. Atserias","year":"2005","unstructured":"Atserias, A.: On digraph coloring problems and treewidth duality. In: Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 106\u2013115. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0195-6698(03)00064-7","volume":"24","author":"J. Ne\u0161et\u0159il","year":"2003","unstructured":"Ne\u0161et\u0159il, J., Shelah, S.: On the order of countable graphs. European J. Combin.\u00a024(6), 649\u2013663 (2003)","journal-title":"European J. Combin."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:34Z","timestamp":1605643114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11917496_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}