| 2026 | AAAI | Exact Algorithms for Distance to Unique Vertex Cover. | Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis |
| 2026 | ESA | Compact Representations of Pattern-Avoiding Permutations. | Lszl Kozma, Michal Opler |
| 2026 | ICALP | Inapproximability of Counting Permutation Patterns. | Michal Opler |
| 2025 | AAAI | Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler |
| 2025 | AAAI | Solving Multiagent Path Finding on Highly Centralized Networks. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu |
| 2025 | ISAAC | Precoloring Extension with Demands on Paths. | Arun Kumar Das, Michal Opler, Toms Valla |
| 2025 | ISAAC | Pathfinding in Self-Deleting Graphs. | Michal Dvork, Dusan Knop, Michal Opler, Jan Pokorn, Ondrej Such, Krisztina Szilgyi |
| 2024 | AAAI | Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler |
| 2024 | FOCS | An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. | Michal Opler |
| 2024 | SODA | The Hierarchy of Hereditary Sorting Operators. | Vt Jelnek, Michal Opler, Jakub Pekrek |
| 2024 | STOC | Optimization with Pattern-Avoiding Input. | Benjamin Aram Berendsohn, Lszl Kozma, Michal Opler |
| 2023 | COCOON | Improved Bounds for the Binary Paint Shop Problem. | Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Smal, Pavel Valtr |
| 2023 | WG | Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. | Pavel Dvork, Luks Folwarczn, Michal Opler, Pavel Pudlk, Robert Smal, Tung Anh Vu |
| 2021 | GD | Non-homotopic Loops with a Bounded Number of Pairwise Intersections. | Vclav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr |
| 2021 | MFCS | Griddings of Permutations and Hardness of Pattern Matching. | Vt Jelnek, Michal Opler, Jakub Pekrek |
| 2021 | WG | Bears with Hats and Independence Polynomials. | Vclav Blazej, Pavel Dvork, Michal Opler |
| 2020 | MFCS | A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. | Vt Jelnek, Michal Opler, Jakub Pekrek |
| 2018 | ESA | Generalized Coloring of Permutations. | Vt Jelnek, Michal Opler, Pavel Valtr |