| The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell) L Barto, M Kozik, T Niven SIAM Journal on Computing 38 (5), 1782-1802, 2009 | 191 | 2009 |
| Constraint satisfaction problems of bounded width L Barto, M Kozik 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 595-603, 2009 | 182 | 2009 |
| Constraint satisfaction problems solvable by local consistency methods L Barto, M Kozik Journal of the ACM (JACM) 61 (1), 1-19, 2014 | 170 | 2014 |
| Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem M Kozik, L Barto Logical Methods in Computer Science 8, 2012 | 135 | 2012 |
| Polymorphisms, and how to use them L Barto, A Krokhin, R Willard Dagstuhl Follow-Ups 7, 2017 | 117 | 2017 |
| The wonderland of reflections L Barto, J Opršal, M Pinsker Israel Journal of Mathematics 223 (1), 363-398, 2018 | 99 | 2018 |
| The dichotomy for conservative constraint satisfaction problems revisited L Barto 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 301-310, 2011 | 77 | 2011 |
| The collapse of the bounded width hierarchy L Barto Journal of Logic and Computation 26 (3), 923-943, 2014 | 66 | 2014 |
| The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems L Barto, M Pinsker 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-8, 2016 | 60 | 2016 |
| Finitely related algebras in congruence distributive varieties have near unanimity terms L Barto Canadian Journal of Mathematics 65 (1), 3-21, 2013 | 57 | 2013 |
| Robust satisfiability of constraint satisfaction problems L Barto, M Kozik Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 48 | 2012 |
| On the scope of the universal-algebraic approach to constraint satisfaction M Hils, M Bodirsky, B Martin Logical Methods in Computer Science 8, 2012 | 40 | 2012 |
| The constraint satisfaction problem and universal algebra L Barto Bulletin of Symbolic Logic 21 (3), 319-337, 2015 | 37 | 2015 |
| Graphs, polymorphisms and the complexity of homomorphism problems L Barto, M Kozik, T Niven Proceedings of the fortieth annual ACM symposium on Theory of computing, 789-796, 2008 | 37 | 2008 |
| The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems L Barto, M Kompatscher, M Olšák, T Van Pham, M Pinsker 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 35 | 2017 |
| CSP dichotomy for special triads L Barto, M Kozik, M Maróti, T Niven Proceedings of the American Mathematical Society 137 (9), 2921-2934, 2009 | 34 | 2009 |
| Near unanimity constraints have bounded pathwidth duality L Barto, M Kozik, R Willard 2012 27th Annual IEEE Symposium on Logic in Computer Science, 125-134, 2012 | 32 | 2012 |
| New conditions for Taylor varieties and CSP L Barto, M Kozik 2010 25th Annual IEEE Symposium on Logic in Computer Science, 100-109, 2010 | 31 | 2010 |
| Congruence distributivity implies bounded width L Barto, M Kozik SIAM Journal on Computing 39 (4), 1531-1542, 2010 | 30 | 2010 |
| Absorption in universal algebra and CSP L Barto, M Kozik Wadern: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2017 | 29 | 2017 |
Marcin KozikProfessor of Computer Science, Jagiellonian UniversityE-mailová adresa ověřena na: uj.edu.pl
