Michal Opler

Orcid: 0000-0002-4389-5807

Affiliations:
  • Czech Technical University, Prague, Czech Republic


According to our database1, Michal Opler authored at least 17 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.
CoRR, 2023

The Hierarchy of Hereditary Sorting Operators.
CoRR, 2023

Optimization with pattern-avoiding input.
CoRR, 2023

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Improved Bounds for the Binary Paint Shop Problem.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021
Two examples of Wilf-collapse.
Discret. Math. Theor. Comput. Sci., 2021

Bears with Hats and Independence Polynomials.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Griddings of Permutations and Hardness of Pattern Matching.
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.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Intersections of Non-homotopic Loops.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018
Generalized Coloring of Permutations.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Splittability and 1-amalgamability of permutation classes.
Discret. Math. Theor. Comput. Sci., 2017

2016
Major index distribution over permutation classes.
Adv. Appl. Math., 2016

Squarability of rectangle arrangements.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016


  Loading...