| 2026 | LICS | A Categorical Perspective on Constraint Satisfaction: The Wonderland of Adjunctions. | Maximilian Hadek, Toms Jakl, Jakub Oprsal |
| 2026 | MFCS | Homotopy Theory in Complexity of the Graph Homomorphism Problem (Invited Talk). | Jakub Oprsal |
| 2025 | SODA | A topological proof of the Hell-Nešetřil dichotomy. | Sebastian Meyer, Jakub Oprsal |
| 2025 | STOC | Hardness of 4-Colouring k-Colourable Graphs. | Sergey Avvakumov, Marek Filakovsk, Jakub Oprsal, Gianluca Tasinato, Uli Wagner |
| 2024 | ICDT | Right-Adjoints for Datalog Programs. | Balder ten Cate, Vctor Dalmau, Jakub Oprsal |
| 2024 | LICS | Local consistency as a reduction between constraint satisfaction problems. | Vctor Dalmau, Jakub Oprsal |
| 2024 | STACS | Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. | Marek Filakovsk, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner |
| 2019 | FOCS | The Complexity of 3-Colouring H-Colourable Graphs. | Andrei A. Krokhin, Jakub Oprsal |
| 2019 | LICS | Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). | Manuel Bodirsky, Antoine Mottet, Miroslav Olsk, Jakub Oprsal, Michael Pinsker, Ross Willard |
| 2019 | STOC | Algebraic approach to promise constraint satisfaction. | Jakub Buln, Andrei A. Krokhin, Jakub Oprsal |
| 2017 | SODA | Robust algorithms with polynomial loss for near-unanimity CSPs. | Vctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal |
| 2014 | MFCS | Universal Lyndon Words. | Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino |