Jakub Opršal
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 | 
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský M, Nakajima TV, Opršal 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11991 |
Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
Search
Filter Publications
Display / Sort
Export / Embed
Grants
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský M, Nakajima TV, Opršal 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11991 |
Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv