Michal Opler

According to our database, Michal Opler authored at least 18 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Generalized Coloring of Permutations.

Vít Jelínek, Michal Opler, Pavel Valtr

Algorithmica, July, 2024

Optimization with Pattern-Avoiding Input.

Benjamin Aram Berendsohn, László Kozma, Michal Opler

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

The Hierarchy of Hereditary Sorting Operators.

Vít Jelínek, Michal Opler, Jakub Pekárek

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences.

Michal Opler

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

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

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Improved Bounds for the Binary Paint Shop Problem.

Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021

Two examples of Wilf-collapse.

Michael Albert, Vít Jelínek, Michal Opler

Discret. Math. Theor. Comput. Sci., 2021

Bears with Hats and Independence Polynomials.

Václav Blazej, Pavel Dvorák, Michal Opler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Griddings of Permutations and Hardness of Pattern Matching.

Vít Jelínek, Michal Opler, Jakub Pekárek

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder.

Vít Jelínek, Michal Opler, Jakub Pekárek

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.

Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Intersections of Non-homotopic Loops.

Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.

Vít Jelínek, Michal Opler, Jakub Pekárek

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2017

Splittability and 1-amalgamability of permutation classes.

Vít Jelínek, Michal Opler

Discret. Math. Theor. Comput. Sci., 2017

2016

Major index distribution over permutation classes.

Michal Opler

Adv. Appl. Math., 2016

Squarability of rectangle arrangements.

Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016