Michal Opler

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 27

Top Topics

Pattern Matching

Exact Algorithms

Minimum Bounding

Top Venues

Discret. Math. Theor. Comput. Sci.

Publications

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI (2024)
Vít Jelínek, Michal Opler, Pavel Valtr
Generalized Coloring of Permutations. Algorithmica 86 (7) (2024)
Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. SODA (2024)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with Pattern-Avoiding Input. STOC (2024)
Pavel Dvorák, Lukas Folwarczny, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. WG (2023)
Jaroslav Hancl, A. Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) (2023)
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR (2023)
Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. CoRR (2023)
Pavel Dvorák, Lukas Folwarczny, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. CoRR (2023)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with pattern-avoiding input. CoRR (2023)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long paths make pattern-counting hard, and deep trees make it harder. CoRR (2021)
Michael Albert, Vít Jelínek, Michal Opler
Two examples of Wilf-collapse. Discret. Math. Theor. Comput. Sci. 22 (2) (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. Graph Drawing (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of permutations and hardness of pattern matching. CoRR (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC (2021)
Václav Blazej, Pavel Dvorák, Michal Opler
Bears with Hats and Independence Polynomials. WG (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of Permutations and Hardness of Pattern Matching. MFCS (2021)
Václav Blazej, Pavel Dvorák, Michal Opler
Bears with Hats and Independence Polynomials. CoRR (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
On the Intersections of Non-homotopic Loops. CALDAM (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. CoRR (2020)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS (2020)
Vít Jelínek, Michal Opler, Pavel Valtr
Generalized Coloring of Permutations. ESA (2018)
Vít Jelínek, Michal Opler
Splittability and 1-amalgamability of permutation classes. Discret. Math. Theor. Comput. Sci. 19 (2) (2017)
Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer
Squarability of rectangle arrangements. CoRR (2016)
Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer
Squarability of rectangle arrangements. CCCG (2016)
Michal Opler
Major index distribution over permutation classes. Adv. Appl. Math. 80 (2016)