Universal Lyndon Words. - Arturo Carpi; Gabriele Fici; Stepan Holub; Jakub Oprsal; Marinella Sciortino (MFCS (1), 2014)

The wonderland of reflections. - Libor Barto; Jakub Oprsal; Michael Pinsker (CoRR, 2015)

Complexity of term representations of finitary functions. - Erhard Aichinger; Nebojsa Mudrinski; Jakub Oprsal (Int. J. Algebra Comput., 2018)

Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties. - Jakub Oprsal (Order, 2018)

The Complexity of 3-Colouring H-Colourable Graphs. - Andrei A. Krokhin; Jakub Oprsal (FOCS, 2019)

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (LICS, 2019)

Algebraic approach to promise constraint satisfaction. - Jakub Bulín; Andrei A. Krokhin; Jakub Oprsal (STOC, 2019)

Deciding the existence of minority terms. - Alexandr Kazda; Jakub Oprsal; Matt Valeriote; Dmitriy Zhuk (CoRR, 2019)

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (CoRR, 2019)

Revisiting Alphabet Reduction in Dinur's PCP. - Venkatesan Guruswami; Jakub Oprsal; Sai Sandeep (Electron. Colloquium Comput. Complex., 2019)

The complexity of 3-colouring H-colourable graphs. - Andrei A. Krokhin; Jakub Oprsal (Electron. Colloquium Comput. Complex., 2019)

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. - Víctor Dalmau; Marcin Kozik; Andrei A. Krokhin; Konstantin Makarychev; Yury Makarychev; Jakub Oprsal (SIAM J. Comput., 2019)

ω-categorical structures avoiding height 1 identities. - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (CoRR, 2020)

Algebraic Approach to Promise Constraint Satisfaction. - Libor Barto; Jakub Bulín; Andrei A. Krokhin; Jakub Oprsal (J. ACM, 2021)

An Invitation to the Promise Constraint Satisfaction Problem. - Andrei A. Krokhin; Jakub Oprsal (Electron. Colloquium Comput. Complex., 2022)

Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. - Balder ten Cate; Víctor Dalmau; Jakub Oprsal (CoRR, 2023)

Topology and Adjunction in Promise Constraint Satisfaction. - Andrei A. Krokhin; Jakub Oprsal; Marcin Wrochna; Stanislav Zivný (SIAM J. Comput., 2023)

Right-Adjoints for Datalog Programs. - Balder ten Cate; Víctor Dalmau; Jakub Oprsal (ICDT, 2024)

Local consistency as a reduction between constraint satisfaction problems. - Víctor Dalmau; Jakub Oprsal (LICS, 2024)

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. - Marek Filakovský; Tamio-Vesa Nakajima; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STACS, 2024)

Functors on Relational Structures Which Admit Both Left and Right Adjoints. - Víctor Dalmau; Andrei A. Krokhin; Jakub Oprsal (SIAM J. Discret. Math., 2024)

A topological proof of the Hell-Nešetřil dichotomy. - Sebastian Meyer; Jakub Oprsal (SODA, 2025)

Hardness of 4-Colouring k-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STOC, 2025)

A categorical perspective on constraint satisfaction: The wonderland of adjunctions. - Maximilian Hadek; Tomas Jakl; Jakub Oprsal (CoRR, 2025)

Hardness of 4-Colourings G-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (CoRR, 2025)