List of publications

Journal papers

2024

  1. Jelínek, V., Opler, M., & Valtr, P. (2024). Generalized Coloring of Permutations. Algorithmica, 86, 2174–2210. doi: 10.1007/s00453-024-01220-9

2023

  1. Blažej, V., Dvořák, P., & Opler, M. (2023). Bears with Hats and Independence Polynomials. Discrete Mathematics & Theoretical Computer Science, vol. 25:2. doi: 10.46298/dmtcs.10802

2021

  1. Albert, M., Jelínek, V., & Opler, M. (2021). Two examples of Wilf-collapse. Discret. Math. Theor. Comput. Sci., 22(2). doi: 10.46298/dmtcs.5986

2017

  1. Jelínek, V., & Opler, M. (2017). Splittability and 1-amalgamability of permutation classes. Discret. Math. Theor. Comput. Sci., 19(2). doi: 10.23638/DMTCS-19-2-4

2016

  1. Opler, M. (2016). Major index distribution over permutation classes. Adv. Appl. Math., 80, 131–150. doi: 10.1016/j.aam.2016.06.011

Conference proceedings

2024

  1. Opler, M. (2024). An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. Proceedings of the 65th IEEE Symposium on Foundations of Computer Science, FOCS ’24.
  2. Berendsohn, B. A., Kozma, L., & Opler, M. (2024). Optimization with pattern-avoiding input. Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC ’24, 671–682. doi: 10.1145/3618260.3649631
  3. Fioravantes, F., Knop, D., Křišťan, J. M., Melissinos, N., & Opler, M. (2024). Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. In M. J. Wooldridge, J. G. Dy, & S. Natarajan (Eds.), Proceedings of the 38th AAAI Conference on Artificial Intelligence, AAAI ’24: Vol. 38, part 16 (pp. 17380–17388). AAAI Press. doi: 10.1609/AAAI.V38I16.29686
  4. Jelínek, V., Opler, M., & Pekárek, J. (2024). The Hierarchy of Hereditary Sorting Operators. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’24, 1447–1464. doi: 10.1137/1.9781611977912.59

2023

  1. Hančl, J., Kabela, A., Opler, M., Sosnovec, J., Šámal, R., & Valtr, P. (2023). Improved Bounds for the Binary Paint Shop Problem. Computing and Combinatorics - 29th International Conference, COCOON 2023, Proceedings, Part II, 14423, 210–221. doi: 10.1007/978-3-031-49193-1_16
  2. Dvořák, P., Folwarczný, L., Opler, M., Pudlák, P., Šámal, R., & Vu, T. A. (2023). Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. In D. Paulusma & B. Ries (Eds.), Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers (Vol. 14093, pp. 305–318). Springer. doi: 10.1007/978-3-031-43380-1_22

2021

  1. Blažej, V., Opler, M., Šileikis, M., & Valtr, P. (2021). On the Intersections of Non-homotopic Loops. In A. Mudgal & C. R. Subramanian (Eds.), Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings (Vol. 12601, pp. 196–205). Springer. doi: 10.1007/978-3-030-67899-9_15
  2. Blažej, V., Opler, M., Šileikis, M., & Valtr, P. (2021). Non-homotopic Loops with a Bounded Number of Pairwise Intersections. In H. C. Purchase & I. Rutter (Eds.), Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers (Vol. 12868, pp. 210–222). Springer. doi: 10.1007/978-3-030-92931-2_15
  3. Jelínek, V., Opler, M., & Pekárek, J. (2021). Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. In P. A. Golovach & M. Zehavi (Eds.), 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal (Vol. 214, pp. 22:1–22:17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi: 10.4230/LIPIcs.IPEC.2021.22
  4. Jelínek, V., Opler, M., & Pekárek, J. (2021). Griddings of Permutations and Hardness of Pattern Matching. In F. Bonchi & S. J. Puglisi (Eds.), 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia (Vol. 202, pp. 65:1–65:22). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi: 10.4230/LIPIcs.MFCS.2021.65
  5. Blažej, V., Dvořák, P., & Opler, M. (2021). Bears with Hats and Independence Polynomials. In L. Kowalik, M. Pilipczuk, & P. Rzazewski (Eds.), Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Vol. 12911, pp. 283–295). Springer. doi: 10.1007/978-3-030-86838-3_22

2020

  1. Jelínek, V., Opler, M., & Pekárek, J. (2020). A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. In J. Esparza & D. Král’ (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Vol. 170, pp. 52:1–52:18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi: 10.4230/LIPIcs.MFCS.2020.52

2018

  1. Jelínek, V., Opler, M., & Valtr, P. (2018). Generalized Coloring of Permutations. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland (Vol. 112, pp. 50:1–50:14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi: 10.4230/LIPIcs.ESA.2018.50

2016

  1. Konečný, M., Kučera, S., Opler, M., Sosnovec, J., Šimsa, Š., & Töpfer, M. (2016). Squarability of rectangle arrangements. In T. C. Shermer (Ed.), Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada (pp. 101–106). Simon Fraser University, Vancouver, British Columbia, Canada.