Squarability of rectangle arrangements. - Matej Konecný; Stanislav Kucera; Michal Opler; Jakub Sosnovec; Stepán Simsa; Martin Töpfer 002 (CCCG, 2016)

Major index distribution over permutation classes. - Michal Opler (Adv. Appl. Math., 2016)

Splittability and 1-amalgamability of permutation classes. - Vít Jelínek; Michal Opler (Discret. Math. Theor. Comput. Sci., 2017)

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. - Vít Jelínek; Michal Opler; Jakub Pekárek (MFCS, 2020)

On the Intersections of Non-homotopic Loops. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (CALDAM, 2021)

Non-homotopic Loops with a Bounded Number of Pairwise Intersections. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (GD, 2021)

Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. - Vít Jelínek; Michal Opler; Jakub Pekárek (IPEC, 2021)

Griddings of Permutations and Hardness of Pattern Matching. - Vít Jelínek; Michal Opler; Jakub Pekárek (MFCS, 2021)

Two examples of Wilf-collapse. - Michael Albert 001; Vít Jelínek; Michal Opler (Discret. Math. Theor. Comput. Sci., 2021)

Improved Bounds for the Binary Paint Shop Problem. - Jaroslav Hancl; Adam Kabela; Michal Opler; Jakub Sosnovec; Robert Sámal; Pavel Valtr 001 (COCOON (2), 2023)

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. - Pavel Dvorák; Lukás Folwarczný; Michal Opler; Pavel Pudlák; Robert Sámal; Tung Anh Vu (WG, 2023)

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (CoRR, 2023)

Bears with Hats and Independence Polynomials. - Václav Blazej; Pavel Dvorák; Michal Opler (Discret. Math. Theor. Comput. Sci., 2023)

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2024)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. - Michal Opler (FOCS, 2024)

The Hierarchy of Hereditary Sorting Operators. - Vít Jelínek; Michal Opler; Jakub Pekárek (SODA, 2024)

Optimization with Pattern-Avoiding Input. - Benjamin Aram Berendsohn; László Kozma 002; Michal Opler (STOC, 2024)

Generalized Coloring of Permutations. - Vít Jelínek; Michal Opler; Pavel Valtr 001 (Algorithmica, 2024)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2025)

Solving Multiagent Path Finding on Highly Centralized Networks. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler; Tung Anh Vu (AAAI, 2025)

Exact Algorithms for Distance to Unique Vertex Cover. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler; Manolis Vasilakis (CoRR, 2025)

Pathfinding in Self-Deleting Graphs. - Michal Dvorák; Dusan Knop; Michal Opler; Jan Pokorný; Ondrej Suchý 001; Krisztina Szilágyi (CoRR, 2025)

When Agents Break Down in Multiagent Path Finding. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler (CoRR, 2025)