Jakub Opršal

Wagner Group

3 Publications

Mark all

[3]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” In 41st International Symposium on Theoretical Aspects of Computer Science, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2023 | Journal Article | IST-REx-ID: 12563 | OA
Krokhin, Andrei, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2023. https://doi.org/10.1137/20m1378223.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2022 | Journal Article | IST-REx-ID: 11991 | OA
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery, 2022. https://doi.org/10.1145/3559736.3559740.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

3 Publications

Mark all

[3]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” In 41st International Symposium on Theoretical Aspects of Computer Science, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2023 | Journal Article | IST-REx-ID: 12563 | OA
Krokhin, Andrei, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2023. https://doi.org/10.1137/20m1378223.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2022 | Journal Article | IST-REx-ID: 11991 | OA
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery, 2022. https://doi.org/10.1145/3559736.3559740.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed