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.
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

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

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