Jakub Opršal
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 | 
Avvakumov, Sergey, et al. “Hardness of 4-Colouring G-Colourable Graphs.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83, doi:10.1145/3717823.3718154.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial and Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11991 |
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
Grants
4 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Avvakumov, Sergey, et al. “Hardness of 4-Colouring G-Colourable Graphs.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83, doi:10.1145/3717823.3718154.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial and Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11991 |
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv