Filakovský M, Nakajima TV, Oprsal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.
LibreCat: https://research-explorer.ista.ac.at/record/7806
DOI: 10.1137/1.9781611975994.47

Filakovský M, Vokínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.
LibreCat: https://research-explorer.ista.ac.at/record/6563
DOI: 10.1007/s10208-019-09419-x
WoS: 000522437400004
arXiv: 1312.2337

Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.
LibreCat: https://research-explorer.ista.ac.at/record/6774
DOI: 10.1007/s41468-018-0021-5