Filakovský, M., Nakajima, T. V., Oprsal, J., Tasinato, G., &; Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2024.34 

Filakovský, M., Wagner, U., &; Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM.https://doi.org/10.1137/1.9781611975994.47 

Filakovský, M., &; Vokínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature.https://doi.org/10.1007/s10208-019-09419-x 

Filakovský, M., Franek, P., Wagner, U., &; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer.https://doi.org/10.1007/s41468-018-0021-5