Michal Opler. Inapproximability of Counting Permutation Patterns. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). 2026. To appear · arXiv:2601.05166
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos, Michal Opler, and Manolis Vasilakis. Exact Algorithms for Distance to Unique Vertex Cover. In Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth
Conference on Innovative Applications of Artificial Intelligence,
Sixteenth Symposium on Educational Advances in Artificial Intelligence,
AAAI 2026, Singapore, January 20-27, 2026, pages 14217–14224. 2026 · doi: 10.1609/AAAI.V40I17.38435 · arXiv:2502.05059
2025
Arun Kumar Das, Michal Opler, and Tomáš Valla. Precoloring Extension with Demands on Paths. In Ho-Lin Chen, Wing-Kai Hon and Meng-Tsung Tsai, editors, 36th International Symposium on Algorithms and Computation (ISAAC 2025), volume 359, pages 23:1–23:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025 · doi: 10.4230/LIPIcs.ISAAC.2025.23 · arXiv:2509.18936
Michal Opler. An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. In Proceedings of the 65th IEEE Symposium on Foundations of Computer Science, FOCS ’24, pages 689–699. IEEE, 2024 · doi: 10.1109/FOCS61266.2024.00049 · arXiv:2409.07868
Jaroslav Hančl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Šámal, and Pavel Valtr. Improved Bounds for the Binary Paint Shop Problem. In Computing and Combinatorics - 29th International Conference, COCOON 2023, Proceedings, Part II, volume 14423, pages 210–221. Springer, 2023 · doi: 10.1007/978-3-031-49193-1_16
Pavel Dvořák, Lukáš Folwarczný, Michal Opler, Pavel Pudlák, Robert Šámal, and Tung Anh Vu. Bounds on Functionality and Symmetric Difference - Two Intriguing
Graph Parameters. In Daniël Paulusma and Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers, volume 14093, pages 305–318. Springer, 2023 · doi: 10.1007/978-3-031-43380-1_22 · arXiv:2302.11862
2021
Václav Blažej, Michal Opler, Matas Šileikis, and Pavel Valtr. On the Intersections of Non-homotopic Loops. In Apurva Mudgal and C. R. Subramanian, editors, Algorithms and Discrete Applied Mathematics - 7th International Conference,
CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings, volume 12601, pages 196–205. Springer, 2021 · doi: 10.1007/978-3-030-67899-9_15 · arXiv:2108.13953
Václav Blažej, Michal Opler, Matas Šileikis, and Pavel Valtr. Non-homotopic Loops with a Bounded Number of Pairwise Intersections. In Helen C. Purchase and Ignaz Rutter, editors, Graph Drawing and Network Visualization - 29th International Symposium,
GD 2021, Tübingen, Germany, September 14-17, 2021, Revised
Selected Papers, volume 12868, pages 210–222. Springer, 2021 · doi: 10.1007/978-3-030-92931-2_15 · arXiv:2108.13953
Vít Jelínek, Michal Opler, and Jakub Pekárek. Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. In Petr A. Golovach and Meirav Zehavi, editors, 16th International Symposium on Parameterized and Exact Computation,
IPEC 2021, September 8-10, 2021, Lisbon, Portugal, volume 214, pages 22:1–22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 · doi: 10.4230/LIPIcs.IPEC.2021.22 · arXiv:2111.03479
Vít Jelínek, Michal Opler, and Jakub Pekárek. Griddings of Permutations and Hardness of Pattern Matching. In Filippo Bonchi and Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, volume 202, pages 65:1–65:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 · doi: 10.4230/LIPIcs.MFCS.2021.65 · arXiv:2107.10897
Václav Blažej, Pavel Dvořák, and Michal Opler. Bears with Hats and Independence Polynomials. In Lukasz Kowalik, Michal Pilipczuk and Pawel Rzazewski, editors, Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers, volume 12911, pages 283–295. Springer, 2021 · doi: 10.1007/978-3-030-86838-3_22 · arXiv:2103.07401
2020
Vít Jelínek, Michal Opler, and Jakub Pekárek. A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. In Javier Esparza and Daniel Král,’ editors, 45th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, volume 170, pages 52:1–52:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 · doi: 10.4230/LIPIcs.MFCS.2020.52 · arXiv:2008.04593
2018
Vít Jelínek, Michal Opler, and Pavel Valtr. Generalized Coloring of Permutations. In Yossi Azar, Hannah Bast and Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22,
2018, Helsinki, Finland, volume 112, pages 50:1–50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018 · doi: 10.4230/LIPIcs.ESA.2018.50
2016
Matěj Konečný, Stanislav Kučera, Michal Opler, Jakub Sosnovec, Štěpán Šimsa, and Martin Töpfer. Squarability of rectangle arrangements. In Thomas C. Shermer, editor, Proceedings of the 28th Canadian Conference on Computational Geometry,
CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada, pages 101–106. Simon Fraser University, Vancouver, British Columbia, Canada, 2016 · arXiv:1611.07073