Publications

Michael Albert, Vít Jelínek, Michal Opler: Two examples of Wilf-collapse
Discrete Mathematics & Theoretical Computer Science vol. 22 no. 2, Permutation Patterns 2019
[10.46298/dmtcs.5986] [arXiv]
Michael Albert, Vít Jelínek, Michal Opler: Wilf collapse in permutation classes
preprint on arXiv, 2019.
[arXiv]
Vít Jelínek, Michal Opler: Splittability and 1-amalgamability of permutation classes
Discrete Mathematics & Theoretical Computer Science 19 (2017) 2, Paper No. 4
[10.23638/DMTCS-19-2-4], [arXiv]
Michal Opler: Major index distribution over permutation classes
Advances in Applied Mathematics vol. 80 (2016). Pages 131–150.
[10.1016/j.aam.2016.06.011], [arXiv]

Conference proceedings

Václav Blažej, Michal Opler, Matas Šileikis, Pavel Valtr: Non-homotopic Loops with a Bounded Number of Pairwise Intersections
29th International Symposium on Graph Drawing and Network Visualization (GD 2021). Full proceedings to appear.
[arXiv]
Vít Jelínek, Michal Opler, Jakub Pekárek: Long paths make pattern-counting hard, and deep trees make it harder
Best student paper at 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Pages 22:1–22:17.
[10.4230/LIPIcs.IPEC.2021.22], [arXiv]
Vít Jelínek, Michal Opler, Jakub Pekárek: Griddings of permutations and hardness of pattern matching
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Pages 65:1–65:22.
[10.4230/LIPIcs.MFCS.2021.65], [arXiv]
Václav Blažej, Pavel Dvořák, Michal Opler: Bears with Hats and Independence Polynomials
47th International Workshop, WG 2021. Pages 283–295.
[10.1007/978-3-030-86838-3_22], [arXiv]
Václav Blažej, Michal Opler, Matas Šileikis, Pavel Valtr: On the Intersections of Non-homotopic Loops
CALDAM 2021: Algorithms and Discrete Applied Mathematics. Pages 196–205.
[10.1007/978-3-030-67899-9_15], [arXiv]
Vít Jelínek, Michal Opler, Jakub Pekárek: A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Pages 52:1–52:18.
[10.4230/LIPIcs.MFCS.2020.52], [arXiv]
Vít Jelínek, Michal Opler, Pavel Valtr: Generalized Coloring of Permutations
Proceedings of the 26th Annual European Symposium on Algorithms (ESA 2018). Pages 50:1–50:14.
[10.4230/LIPIcs.ESA.2018.50]
Matěj Konečný, Stanislav Kučera, Michal Opler, Jakub Sosnovec, Štěpán Šimsa, Martin Töpfer: Squarability of Rectangle Arrangements
Proceedings of the 28th Canadian Conference on Computational Geometry (2016)
[arXiv]

Master thesis

Structural properties of hereditary permutation classes
Advised by Vít Jelínek
record in the thesis repository of Charles University

Bachelor thesis

Pattern-avoiding permutation classes
Advised by Vít Jelínek
record in the thesis repository of Charles University