{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:27Z","timestamp":1759638147854},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_26","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"295-306","source":"Crossref","is-referenced-by-count":2,"title":["Locally Consistent Constraint Satisfaction Problems with Binary Constraints"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: The Complexity of Maximal Constraint Languages. In: Proc. 33rd Symp. on Theory of Computation, STOC, pp. 667\u2013674 (2001)","DOI":"10.1145\/380752.380868"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S., Mitchell, D.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in DMTCS, vol.\u00a035. AMS (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-48085-3_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"V. Dalmau","year":"1999","unstructured":"Dalmau, V., Pearson, J.: Closure Functions and Width 1 Problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 159\u2013173. Springer, Heidelberg (1999)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(97)86737-0","volume":"173","author":"R. Dechter","year":"1997","unstructured":"Dechter, R., van Beek, P.: Local and Global Relational Consistency. Theor. Comput. Sci.\u00a0173, 283\u2013308 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","unstructured":"Dvo\u0159\u00e1k, Z.: personal communication"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-540-27836-8_41","volume-title":"Automata, Languages and Programming","author":"Z. Dvo\u0159\u00e1k","year":"2004","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., Pangr\u00e1c, O.: Locally Consistent Constraint Satisfaction Problems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 469\u2013480. Springer, Heidelberg (2004)"},{"key":"26_CR7","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., Pangr\u00e1c, O.: Locally Consistent Constraint Satisfaction Problems. To appear in Theor. Comput. Sci."},{"key":"26_CR8","unstructured":"Eppstein, D.: Improved Algorithms for 3-coloring, 3-edge-coloring and Constraint Satisfaction. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 329\u2013337 (2001)"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0196-6774(02)00224-9","volume":"45","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R.: Worst-case Time Bounds for Coloring and Satisfiability Problems. J. Algorithms\u00a045(2), 192\u2013201 (2002)","journal-title":"J. Algorithms"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.: Monotone monadic SNP and constraint satisfaction. In: Proc. 25th Symposium on the Theory of Computation, STOC, pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"key":"26_CR11","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. J. ACM\u00a029, 24\u201332 (1982)","journal-title":"J. ACM"},{"key":"26_CR12","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)"},{"issue":"4","key":"26_CR13","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.\u00a0348(4), 1281\u20131297 (1996)","journal-title":"Trans. Amer. Math."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(85)90166-5","volume":"40","author":"M.A. Huang","year":"1985","unstructured":"Huang, M.A., Lieberherr, K.: Implications of Forbidden Structures for Extremal Algorithmic Problems. Theor. Comput. Sci.\u00a040, 195\u2013210 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"26_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics with Applications in Computer Science","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics with Applications in Computer Science. Springer, Heidelberg (2001)"},{"key":"26_CR17","first-page":"323","volume-title":"Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"D. Kr\u00e1l\u2019","year":"2004","unstructured":"Kr\u00e1l\u2019, D.: Locally Satisfiable Formulas. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 323\u2013332. SIAM, Philadelphia (2004)"},{"key":"26_CR18","unstructured":"Kr\u00e1l\u2019, D., Pangr\u00e1c, O.: An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems (submitted)"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/322248.322260","volume":"28","author":"K. Lieberherr","year":"1981","unstructured":"Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction. J. of the ACM\u00a028(2), 411\u2013422 (1981)","journal-title":"J. of the ACM"},{"key":"26_CR20","unstructured":"Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction II. Technical Report 293, Dept. of EECS, Princeton University (1982)"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1214\/aoms\/1177703585","volume":"35","author":"Z. Usiskin","year":"1963","unstructured":"Usiskin, Z.: Max-min Probabilities in the Voting Paradox. Ann. Math. Stat.\u00a035, 857\u2013862 (1963)","journal-title":"Ann. Math. Stat."},{"key":"#cr-split#-26_CR22.1","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: On Local versus Global Satisfiability. SIAM J. Discrete Math. 17(4), 541???547 (2004);","DOI":"10.1137\/S0895480197326528"},{"key":"#cr-split#-26_CR22.2","unstructured":"A preliminary version available as ECCC report TR97-12"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact Algorithms for NP-hard Problems: A Survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M. Yannakakis","year":"1994","unstructured":"Yannakakis, M.: On the Approximation of Maximum Satisfiability. J. Algorithms\u00a017, 475\u2013502 (1994)","journal-title":"J. Algorithms"}],"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\/11604686_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:24Z","timestamp":1619507064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11604686_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}