Computing simplicial representatives of homotopy group element. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (CoRR, 2017)

Computing simplicial representatives of homotopy group elements. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (J. Appl. Comput. Topol., 2018)

Embeddability of Simplicial Complexes is Undecidable. - Marek Filakovský; Uli Wagner 001; Stephan Zhechev (SODA, 2020)

Are Two Given Maps Homotopic? An Algorithmic Viewpoint. - Marek Filakovský; Lukás Vokrínek (Found. Comput. Math., 2020)

Computing Homotopy Classes for Diagrams. - Marek Filakovský; Lukás Vokrínek (Discret. Comput. Geom., 2023)

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. - Marek Filakovský; Tamio-Vesa Nakajima; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STACS, 2024)

Hardness of 4-Colouring k-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STOC, 2025)

Hardness of 4-Colourings G-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (CoRR, 2025)