Follow
Libor Barto
Libor Barto
Department of Algebra, Charles University, Prague
Verified email at mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
Constraint satisfaction problems solvable by local consistency methods
L Barto, M Kozik
Journal of the ACM (JACM) 61 (1), 1-19, 2014
2042014
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
2042009
Constraint satisfaction problems of bounded width
L Barto, M Kozik
2009 50th Annual IEEE symposium on foundations of computer science, 595-603, 2009
1892009
Polymorphisms, and how to use them
L Barto, A Krokhin, R Willard
Dagstuhl Follow-Ups 7, 2017
1592017
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
L Barto, M Kozik
Logical Methods in Computer Science 8, 2012
1532012
The wonderland of reflections
L Barto, J Opršal, M Pinsker
Israel Journal of Mathematics 223 (1), 363-398, 2018
1332018
Algebraic approach to promise constraint satisfaction
L Barto, J Bulín, A Krokhin, J Opršal
Journal of the ACM (JACM) 68 (4), 1-66, 2021
872021
The dichotomy for conservative constraint satisfaction problems revisited
L Barto
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 301-310, 2011
862011
The collapse of the bounded width hierarchy
L Barto
Journal of Logic and Computation 26 (3), 923-943, 2014
762014
The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
L Barto, M Pinsker
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
702016
Finitely related algebras in congruence distributive varieties have near unanimity terms
L Barto
Canadian Journal of Mathematics 65 (1), 3-21, 2013
612013
Robust satisfiability of constraint satisfaction problems
L Barto, M Kozik
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
522012
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
472017
The constraint satisfaction problem and universal algebra
L Barto
Bulletin of Symbolic Logic 21 (3), 319-337, 2015
462015
Robustly solvable constraint satisfaction problems
L Barto, M Kozik
SIAM Journal on Computing 45 (4), 1646-1669, 2016
382016
Absorption in universal algebra and CSP
L Barto, M Kozik
Wadern: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2017
372017
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
362008
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)
L Barto, M Pinsker
SIAM Journal on Computing 49 (2), 365-393, 2020
352020
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
352009
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
342012
The system can't perform the operation now. Try again later.
Articles 1–20