About me

I am an Assistant Professor at the Department of Theoretical Computer Science and Mathematical Logic (“KTIML”), Faculty of Mathematics and Physics of the Charles University in Prague, Czechia.

I am one of the logicians in this picture.

Get in touch

Office hours: scheduled for Friday 10:40am; or make an appointment!


Fall 2022

My course schedule for the current semester. Archive of past courses.

Theses and projects

I can offer theses in theoretical computer science as well as several research software projects. Informal inquiries are most welcome!


My primary research interests lie in the intersection of theoretical computer science, computational logic, and universal algebra. A majority of my work is concerned with the complexity of the constraint satisfaction problem. I am also interested in constraint modeling, automated theorem proving, and artificial intelligence.

Selected publications

  1. M. Bodirsky, J. Bulín, F. Starke, and M. Wernthaler. The Smallest Hard Trees, arXiv.2205.07528 (May 2022)

  2. L. Barto, J. Bulín, A. Krokhin, and J. Opršal. Algebraic Approach to Promise Constraint Satisfaction, Journal of the ACM 68, 4, Article 28 (August 2021), 66 pages. DOI

  3. J. Bulín. On the complexity of H-coloring for special oriented trees, European Journal of Combinatorics 69, 54–75 (2018)

  4. L. Barto, J. Bulín. Deciding absorption in relational structures, Algebra Universalis 78(1), 3–18 (2017)

  5. J. Bulín, D. Delić, M. Jackson, and T. Niven. A finer reduction of constraint problems to digraphs, Logical Methods in Computer Science 11(4:18), 1–33 (2015)

My papers in BibTeX (updated jul-2022), on Google Scholar, on ArXiv, and my ORCID page.