Michal Opler

46 papers A* 7A 2B 7Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2026 A* conf
Exact Algorithms for Distance to Unique Vertex Cover.
AAAI
Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2026 J jnl
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.
J. Artif. Intell. Res.
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2026 J jnl
Fast and simple multiplication of bounded twin-width matrices.
CoRR
László Kozma, Michal Opler
2026 J jnl
Inapproximability of Counting Permutation Patterns.
CoRR
Michal Opler
2025 J jnl
Compact representations of pattern-avoiding permutations.
CoRR
László Kozma, Michal Opler
2025 J jnl
Exact Algorithms for Distance to Unique Vertex Cover.
CoRR
Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2025 A* conf
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.
AAAI
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2025 J jnl
Monadic Second-Order Logic of Permutations.
CoRR
Vít Jelínek, Michal Opler
2025 B conf
Pathfinding in Self-Deleting Graphs.
ISAAC
Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025 J jnl
Pathfinding in Self-Deleting Graphs.
CoRR
Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025 B conf
Precoloring Extension with Demands on Paths.
ISAAC
Arun Kumar Das, Michal Opler, Tomás Valla
2025 J jnl
Precoloring extension with demands on paths.
CoRR
Arun Kumar Das, Michal Opler, Tomás Valla
2025 A* conf
Solving Multiagent Path Finding on Highly Centralized Networks.
AAAI
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2025 J jnl
When Agents Break Down in Multiagent Path Finding.
CoRR
Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler
2024 A* conf
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences.
FOCS
Michal Opler
2024 J jnl
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences.
CoRR
Michal Opler
2024 A* conf
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.
AAAI
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024 J jnl
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.
CoRR
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024 J jnl
Generalized Coloring of Permutations.
Algorithmica
Vít Jelínek, Michal Opler, Pavel Valtr
2024 A* conf
Optimization with Pattern-Avoiding Input.
STOC
Benjamin Aram Berendsohn, László Kozma, Michal Opler
2024 J jnl
Solving Multiagent Path Finding on Highly Centralized Networks.
CoRR
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2024 A* conf
The Hierarchy of Hereditary Sorting Operators.
SODA
Vít Jelínek, Michal Opler, Jakub Pekárek
2023 J jnl
Bears with Hats and Independence Polynomials.
Discret. Math. Theor. Comput. Sci.
Václav Blazej, Pavel Dvorák, Michal Opler
2023 B conf
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
WG
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 J jnl
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
CoRR
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 J jnl
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.
CoRR
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2023 — conf
Improved Bounds for the Binary Paint Shop Problem.
COCOON (2)
Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr
2023 J jnl
Optimization with pattern-avoiding input.
CoRR
Benjamin Aram Berendsohn, László Kozma, Michal Opler
2023 J jnl
The Hierarchy of Hereditary Sorting Operators.
CoRR
Vít Jelínek, Michal Opler, Jakub Pekárek
2021 B conf
Bears with Hats and Independence Polynomials.
WG
Václav Blazej, Pavel Dvorák, Michal Opler
2021 J jnl
Bears with Hats and Independence Polynomials.
CoRR
Václav Blazej, Pavel Dvorák, Michal Opler
2021 B conf
Griddings of Permutations and Hardness of Pattern Matching.
MFCS
Vít Jelínek, Michal Opler, Jakub Pekárek
2021 J jnl
Griddings of permutations and hardness of pattern matching.
CoRR
Vít Jelínek, Michal Opler, Jakub Pekárek
2021 B conf
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder.
IPEC
Vít Jelínek, Michal Opler, Jakub Pekárek
2021 J jnl
Long paths make pattern-counting hard, and deep trees make it harder.
CoRR
Vít Jelínek, Michal Opler, Jakub Pekárek
2021 A conf
Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
GD
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021 J jnl
Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
CoRR
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021 — conf
On the Intersections of Non-homotopic Loops.
CALDAM
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021 J jnl
Two examples of Wilf-collapse.
Discret. Math. Theor. Comput. Sci.
Michael Albert, Vít Jelínek, Michal Opler
2020 B conf
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.
MFCS
Vít Jelínek, Michal Opler, Jakub Pekárek
2020 J jnl
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.
CoRR
Vít Jelínek, Michal Opler, Jakub Pekárek
2018 A conf
Generalized Coloring of Permutations.
ESA
Vít Jelínek, Michal Opler, Pavel Valtr
2017 J jnl
Splittability and 1-amalgamability of permutation classes.
Discret. Math. Theor. Comput. Sci.
Vít Jelínek, Michal Opler
2016 J jnl
Major index distribution over permutation classes.
Adv. Appl. Math.
Michal Opler
2016 — conf
Squarability of rectangle arrangements.
CCCG
Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer
2016 J jnl
Squarability of rectangle arrangements.
CoRR
Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer