On the Reduction of the CSP Dichotomy Conjecture to Digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (CP, 2013)

Csp Dichotomy for Special Polyads. - Libor Barto; Jakub Bulin (Int. J. Algebra Comput., 2013)

On the complexity of $ mathbb H$-coloring for special oriented trees. - Jakub Bulin (CoRR, 2014)

A finer reduction of constraint problems to digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (Log. Methods Comput. Sci., 2015)

On the complexity of ℍ-coloring for special oriented trees. - Jakub Bulin (Eur. J. Comb., 2018)

Algebraic approach to promise constraint satisfaction. - Jakub Bulín; Andrei A. Krokhin; Jakub Oprsal (STOC, 2019)

Algebraic Approach to Promise Constraint Satisfaction. - Libor Barto; Jakub Bulín; Andrei A. Krokhin; Jakub Oprsal (J. ACM, 2021)

Short Definitions in Constraint Languages. - Jakub Bulín; Michael Kompatscher (MFCS, 2023)

The smallest hard trees. - Manuel Bodirsky; Jakub Bulín; Florian Starke; Michael Wernthaler (Constraints An Int. J., 2023)