Filakovský, Marek, Tamio Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.”https://doi.org/10.4230/LIPIcs.STACS.2024.34__In 41st International Symposium on Theoretical Aspects of Computer Science, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.STACS.2024.34 .

Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.”https://doi.org/10.1137/1.9781611975994.47__In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020.https://doi.org/10.1137/1.9781611975994.47 .

Filakovský, Marek, and Lukas Vokínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.”https://doi.org/10.1007/s10208-019-09419-x__Foundations of Computational Mathematics. Springer Nature, 2020.https://doi.org/10.1007/s10208-019-09419-x .

Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.”https://doi.org/10.1007/s41468-018-0021-5__Journal of Applied and Computational Topology. Springer, 2018.https://doi.org/10.1007/s41468-018-0021-5 .