Get started
Author

Michal Opler

Observed names: M. Opler, Opler, Michal
ORCID: 0000-0002-4389-5807
Observed ORCID: 0000-0002-4389-5807
OpenAlex ID: A5006649123
Bears with Hats and Independence Polynomials
2021 · Václav Blažej, Pavel Dvořák, et al. · Lecture notes in computer science · 4
Generalized Coloring of Permutations
2024 · Vít Jelínek, Michal Opler, et al. · Algorithmica · 3
PDF
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
2024 · Foivos Fioravantes, Dušan Knop, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 3
PDF
Solving Multiagent Path Finding on Highly Centralized Networks
2025 · Foivos Fioravantes, Dušan Knop, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 2
PDF
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
2025 · Foivos Fioravantes, Dušan Knop, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 1
PDF
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
2024 · Michal Opler · Annual Symposium on Foundations of Computer Science · 1
PDF
Optimization with Pattern-Avoiding Input
2024 · Benjamin Aram Berendsohn, László Kozma, et al. · ACM Symposium on Theory of Computing (STOC) · 1
Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters
2023 · Pavel Dvořák, Lukáš Folwarczný, et al. · Lecture notes in computer science · 1
PDF
On the Intersections of Non-homotopic Loops
2021 · Václav Blažej, Michal Opler, et al. · Lecture notes in computer science · 1
Non-homotopic Loops with a Bounded Number of Pairwise Intersections
2021 · Václav Blažej, Michal Opler, et al. · Lecture notes in computer science · 1
PDF
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder
2021 · Jelínek, Vít, Opler, Michal, et al. · arXiv (Cornell University) · 1
PDF
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
2020 · Jelínek, Vít, Opler, Michal, et al. · arXiv (Cornell University) · 1
PDF
Wilf collapse in permutation classes
2019 · Albert, Michael, Jelínek, Vít, et al. · arXiv (Cornell University) · 1
PDF
Major index distribution over permutation classes
2015 · Opler, Michal · arXiv (Cornell University) · 1
PDF
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
2026 · Foivos Fioravantes, Dušan Knop, et al. · Journal of Artificial Intelligence Research
PDF
Exact Algorithms for Distance to Unique Vertex Cover
2026 · Foivos Fioravantes, Dušan Knop, et al. · Proceedings of the AAAI Conference on Artificial Intelligence
Linear clique-width and modular decomposition
2026 · Brignall, Robert, Opler, Michal, et al. · arXiv (Cornell University)
PDF
Fast and simple multiplication of bounded twin-width matrices
2026 · Kozma, László, Opler, Michal · arXiv (Cornell University)
PDF
Inapproximability of Counting Permutation Patterns
2026 · Opler, Michal · arXiv (Cornell University)
PDF
Pathfinding in Self-Deleting Graphs
2026 · Michal Dvořák, Dusan Knop, et al. · SSRN Electronic Journal
Inapproximability of Counting Permutation Patterns
2026 · Opler, Michal · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Compact Representations of Pattern-Avoiding Permutations
2025 · Kozma, László, Opler, Michal · arXiv (Cornell University)
PDF
Density of Traceable Graphs
2025 · Dvořák, Michal, Knop, Dušan, et al. · arXiv (Cornell University)
PDF
Exact Algorithms for Distance to Unique Vertex Cover
2025 · Fioravantes, Foivos, Knop, Dušan, et al. · arXiv (Cornell University)
PDF
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
2024 · Fioravantes, Foivos, Knop, Dušan, et al. · arXiv (Cornell University)
PDF
Works count: 38
Citation count: 22
H-index: 3
I10-index:
Year
Topic
Type