Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Oprsal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Oprsal, M. Wrochna, S. divný, SIAM Journal on Computing 52 (2023) 38–79.

An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Oprsal, ACM SIGLOG News 9 (2022) 30–59.