Scholar
Jakub Opršal
Google Scholar ID: FSut4R4AAAAJ
University of Birmingham
Citations & Impact
Citations
571
H-index
11
i10-index
15
Publications
20
Co-authors
26
list available
Publications
Resume (English only)
Academic Achievements
- Meyer, S. & Opršal, J. (2025). A topological proof of the Hell–Nešetřil dichotomy. SODA 2025
- Dalmau, V. & Opršal, J. (2024). Local consistency as a reduction between constraint satisfaction problems. LICS 2024
- Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing
- Barto, L., Bulín, J., Krokhin, A., & Opršal, J. (2021). Algebraic approach to promise constraint satisfaction. J. ACM
- Jakl, T., Hadek, M., & Opršal, J. (2025). A categorical perspective on constraint satisfaction: The wonderland of adjunctions. arXiv:2503.10353
- Avvakumov, S. et al. (2025). Hardness of 4-colouring G-colourable graphs. STOC 2025
- ten Cate, B., Dalmau, V., & Opršal, J. (2024). Right-Adjoints for Datalog Programs. ICDT 2024
- Filakovský, M. et al. (2024). Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS 2024
- Guruswami, V., Opršal, J., & Sandeep, S. (2020). Revisiting alphabet reduction in Dinur’s PCP. APPROX/RANDOM 2020
- Bodirsky, M. et al. (2019). Topology is relevant (in a dichotomy conjecture for infinite-domain CSP). LICS 2019
Research Experience
- Assistant Professor at University of Birmingham
- Post-doc at ISTA (2022–23)
- Post-doc at Oxford (2021–22)
- Post-doc at Durham University (2018–21)
- Post-doc at TU Dresden (2016–18)
- Post-doc at Jagiellonian University (2016)
