{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:16:46Z","timestamp":1791137806495,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993724","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"655-664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Schaefer's theorem for graphs"],"prefix":"10.1145","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Pinsker","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Denis-Diderot, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273534"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_8"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.050"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1286198146"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9083-9"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667058"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1740582.1740583"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi083"},{"key":"e_1_3_2_2_9_1","volume-title":"Model Theoretic Methods in Finite Combinatorics, Contemporary mathematics","author":"Bodirsky Manuel","unstructured":"Manuel Bodirsky and Michael Pinsker . Reducts of Ramsey structures . In Model Theoretic Methods in Finite Combinatorics, Contemporary mathematics . American Mathematical Society . To appear; preprint available from the authors' websites. Manuel Bodirsky and Michael Pinsker. Reducts of Ramsey structures. In Model Theoretic Methods in Finite Combinatorics, Contemporary mathematics. American Mathematical Society. To appear; preprint available from the authors' websites."},{"key":"e_1_3_2_2_10_1","volume-title":"Minimal functions on the random graph. Preprint, arXiv:1003.4030","author":"Bodirsky Manuel","year":"2010","unstructured":"Manuel Bodirsky and Michael Pinsker . Minimal functions on the random graph. Preprint, arXiv:1003.4030 , 2010 . Manuel Bodirsky and Michael Pinsker. Minimal functions on the random graph. Preprint, arXiv:1003.4030, 2010."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993724"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.11"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60406-5_32"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8268-2_15"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/355483.355485"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-004-5899-8"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"e_1_3_2_2_20_1","first-page":"1331","volume-title":"Handbook of Combinatorics","author":"Nesetril Jaroslav","year":"1995","unstructured":"Jaroslav Nesetril . Ramsey theory . Handbook of Combinatorics , pages 1331 -- 1403 , 1995 . Jaroslav Nesetril. Ramsey theory. Handbook of Combinatorics, pages 1331--1403, 1995."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90055-9"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-010-0082-3"},{"key":"e_1_3_2_2_24_1","volume-title":"S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures. Les Presses de L'Universit\u00e9 de Montr\u00e9al","author":"Szendrei \u00c1gnes","year":"1986","unstructured":"\u00c1gnes Szendrei . Clones in universal algebra . S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures. Les Presses de L'Universit\u00e9 de Montr\u00e9al , 1986 . \u00c1gnes Szendrei. Clones in universal algebra. S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures. Les Presses de L'Universit\u00e9 de Montr\u00e9al, 1986."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274912"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(95)00061-5"},{"key":"e_1_3_2_2_27_1","first-page":"628","volume-title":"Proceedings of the 21th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Westphal Matthias","year":"2009","unstructured":"Matthias Westphal and Stefan W\u00f6lfl . Qualitative CSP , finite CSP, and SAT : Comparing methods for Qualitative Constraint-based Reasoning . In Proceedings of the 21th International Joint Conference on Artificial Intelligence (IJCAI) , pages 628 -- 633 , 2009 . Matthias Westphal and Stefan W\u00f6lfl. Qualitative CSP, finite CSP, and SAT: Comparing methods for Qualitative Constraint-based Reasoning. In Proceedings of the 21th International Joint Conference on Artificial Intelligence (IJCAI), pages 628--633, 2009."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:06:11Z","timestamp":1750230371000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":27,"alternative-id":["10.1145\/1993636.1993724","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993724","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}