Jakub Opršal
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 | 
Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
[Published Version]
View
| Files available
| DOI
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
2022 | Published | Journal Article | IST-REx-ID: 11991 |
An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
Grants
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
[Published Version]
View
| Files available
| DOI
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
2022 | Published | Journal Article | IST-REx-ID: 11991 |
An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.