| Algebraic approach to promise constraint satisfaction J Bulín, A Krokhin, J Opršal Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 56 | 2019 |
| A finer reduction of constraint problems to digraphs T Niven, M Jackson, D Delic, J Bulín Logical Methods in Computer Science 11, 2015 | 27 | 2015 |
| On the reduction of the CSP dichotomy conjecture to digraphs J Bulín, D Delić, M Jackson, T Niven International Conference on Principles and Practice of Constraint …, 2013 | 27 | 2013 |
| 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 | 24 | 2021 |
| CSP dichotomy for special polyads L Barto, J Bulín International Journal of Algebra and Computation 23 (05), 1151-1174, 2013 | 12 | 2013 |
| On the complexity of H-coloring for special oriented trees J Bulín European Journal of Combinatorics 69, 54-75, 2018 | 7* | 2018 |
| Decidability of absorption in relational structures of bounded width J Bulín Algebra universalis 72 (1), 15-28, 2014 | 7 | 2014 |
| Deciding absorption in relational structures L Barto, J Bulín Algebra universalis 78 (1), 3-18, 2017 | 4 | 2017 |
| Constraint satisfaction, graphs and algebras J Bulín Univerzita Karlova, Matematicko-fyzikální fakulta, 2014 | | 2014 |
| Algebraický přístup k CSP J Bulín Univerzita Karlova, Matematicko-fyzikální fakulta, 2010 | | 2010 |
| SVOˇC 2009 J Bulın | | 2009 |
| Selected Topics from Tame Congruence Theory J Bulín Univerzita Karlova, Matematicko-fyzikální fakulta, 2008 | | 2008 |
| CSP dichotomy for special polyads J Bulın | | |
Jakub OpršalUniversity of OxfordE-mailová adresa ověřena na: cs.ox.ac.uk
