Filakovský M, Nakajima TV, Oprsal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

Krokhin A, Oprsal J, Wrochna M, divný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.
LibreCat: https://research-explorer.ista.ac.at/record/12563
DOI: 10.1137/20m1378223
WoS: 000955000000001
arXiv: 2003.11351

Krokhin A, Oprsal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.
LibreCat: https://research-explorer.ista.ac.at/record/11991
DOI: 10.1145/3559736.3559740
arXiv: 2208.13538