Fingerprint
Dive into the research topics where Jakub Oprsal is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
A topological proof of the Hell–Nešetřil dichotomy
Meyer, S. & Opršal, J., 7 Jan 2025, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Azar, Y. & Panigrahi, D. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 4507-4519 13 p. (Proceedings).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Hardness of 4-Colouring 𝐺-Colourable Graphs
Avvakumov, S., Filakovský, M., Opršal, J., Tasinato, G. & Wagner, U., 15 Jun 2025, STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucký, M. & Bansal, N. (eds.). Association for Computing Machinery (ACM), p. 72-83 12 p. (Conference proceedings of the annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile81 Downloads (Pure) -
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
Filakovský, M., Nakajima, T.-V., Opršal, J., Tasinato, G. & Wagner, U., 2 Dec 2025, (E-pub ahead of print) In: ACM Transactions on Computation Theory.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Functors on Relational Structures Which Admit Both Left and Right Adjoints
Dalmau, V., Krokhin, A. & Opršal, J., Sept 2024, In: SIAM Journal on Discrete Mathematics. 38, 3, p. 2041–2068 28 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs
Filakovský, M., Nakajima, T.-V., Opršal, J., Tasinato, G. & Wagner, U., 11 Mar 2024, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Beyersdorff , O., Kanté, M. M., Kupferman, O. & Lokshtanov, D. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik , p. 34:1-34:19 19 p. 34. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 289).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile55 Downloads (Pure)