Filakovský, M., Nakajima, T. V., Oprsal, J., Tasinato, G., &; Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2024.34 

Krokhin, A., Oprsal, J., Wrochna, M., &; divný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/20m1378223 

Krokhin, A., &; Oprsal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery.https://doi.org/10.1145/3559736.3559740