Libor Barto

Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing, IEEE Symposium on Logic in Computer Science [LICS] vol. brak (2023), 1-13

Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2022), pp.1204 - 1220

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, IEEE Symposium on Logic in Computer Science [LICS] vol. 1 (2021), 1-13

Sensitive Instances of the Constraint Satisfaction Problem, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2020), 110:1-110:18

Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Robustly Solvable Constraint Satisfaction Problems, SIAM Journal on Computing vol. 45(4) (2016), 1646–1669

Mal’tsev conditions, lack of absorption, and solvability, Algebra Universalis vol. 74 (2015), 185-206

Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM vol. 61 (2014), article no. 3

Robust Satisfiability of Constraint Satisfaction Problems, Proceedings of the 44th Acm Symposium On Theory of Computing, Stoc'12 (2012), 931-940

Near unanimity constraints have bounded pathwidth duality, Proceedings of the 27th Ieee/acm Symposium On Logic in Computer Science Lics'12 (2012), 125-134

Absorbing subalgebra, cyclic terms and the Constraint Satisfaction Problem, Logical Methods in Computer Science vol. 20 (2012), paper no. 7

Cyclic terms for SD(V) varieties revisited, Algebra Universalis vol. 64 (2010), 137-142

New conditions for Taylor varieties and CSP, Proceedings of the 25th Ieee/acm Symposium On Logic in Computer Science Lics'10 (2010), 100-109

The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM Journal on Computing vol. 38 (2009), 1782-1802

Congruence distributivity implies bounded width, SIAM Journal on Computing vol. 39 (2009), 1531-1542

CSP dichotomy for special triads, Proceedings of the American Mathematical Society vol. 137 (2009), 2921-2934

Constraint Satisfaction Problems of Bounded Width, Proceedings of the 50th Symposium On Foundations of Computer Science, Focs'09 (2009), 595-603

Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis vol. 61 (2009), 365-380

Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th Acm Symposium On Theory of Computing, Stoc'08 (2008), 789-796