Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, ACM Transactions on Computation Theory 18 (2026).

Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Oprsal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.

Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokínek, Foundations of Computational Mathematics 20 (2020) 311–330.

Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.