My work lies at the interface of mathematics and computer science. I study constraint satisfaction problems and their approximation and promise variants using universal algebra, homotopy theory, combinatorics, and logic.
I was an IST-Bridge Fellow at ISTA with a project ‘Topology and the complexity of approximate graph colouring’ supported by MSCA (2022–2023). Before that I went through a few post positions at Oxford (2021–2022) and Durham University (2018–2021) in the UK, at TU Dresden (2016–2018) in Germany, and at Jagiellonian University (2016) in Poland. I had a chance to work on two ERC grants: Standa Živný’s Starting Grant ‘PowAlgDO’ and Manuel Bodirsky’s Consolidator Grant ‘CSP-Infinity’.
I received my PhD at Charles University in Prague on 29 Feb 2016. My advisor was Libor Barto.
some selected papers
Dalmau, V., & Opršal, J. (2024).
Local consistency as a reduction between constraint satisfaction problems
Accepted to LICS 2024!
Krokhin, A., & Opršal, J. (2019).
The complexity of 3-colouring H-colourable graphs.
FOCS 2019 (pp. 1227–1239).
arXiv:1904.03214, doi:10.1109/FOCS.2019.00076
Barto, L., Bulín, J., Krokhin, A., & Opršal, J. (2021).
Algebraic approach to promise constraint satisfaction.
J. ACM, 68(4), 28:1–66.