Mgr. Marek Filakovský, Ph.D.

2025

• Hardness of 4-Colouring 𝐺-Colourable Graphs

  FILAKOVSKÝ Marek AVVAKUMOV Sergey OPRŠAL Jakub TASINATO Gianluca WAGNER Uli

  Article in Proceedings

  STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, year: 2025

2024

• Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs

  FILAKOVSKÝ Marek NAKAJIMA Tamio-Vesa OPRSAL Jakub TASINATO Gianluca WAGNER Uli

  Article in Proceedings

  41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, year: 2024

2023

• Computing Homotopy Classes for Diagrams

  FILAKOVSKÝ Marek VOKRINEK Lukas

  Article in Periodical

  DISCRETE & COMPUTATIONAL GEOMETRY, year: 2023, volume: 70, edition: 3, DOI

2020

• Embeddability of Simplicial Complexes is Undecidable

  FILAKOVSKÝ Marek WAGNER Uli ZHECHEV Stephan

  Article in Proceedings

  PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), year: 2020

2014

• Effective homology for homotopy colimit and cofibrant replacement

  FILAKOVSKÝ Marek

  Article in Periodical

  Arch. Math. (Brno), year: 2014, volume: 50, edition: 5, DOI

2012

• Effective chain complexes for twisted products

  FILAKOVSKÝ Marek

  Article in Periodical

  Arch. Math. (Brno), year: 2012, volume: 48, edition: 5, DOI