Assistant Professor @ University of Birmingham
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.
Oct 2023 I am joining the University of Birmingham as an Assistant Professor!
Jul 2023 talk @ An invitation to promise constraint satisfaction, Resources and Co-resources workshop, Cambridge, UK, 18 Jul 2023. (slides)
Yoneda Lemma in promise CSP (3 Jul 2023)
Dalmau, V., & Opršal, J. (2023).
Preprint. arXiv:2301.05084.
Krokhin, A., & Opršal, J. (2019).
60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019 (pp. 1227–1239).
arXiv:1904.03214,
doi:10.1109/
Barto, L., Bulín, J., Krokhin, A., & Opršal, J. (2021).
J. ACM, 68(4), 28:1–66. arXiv:1811.00970, doi:10.1145⁄3457606
I was an IST-Bridge Fellow at Institute of Science and Technology Austria 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.