Marek Filakovský

According to our database, Marek Filakovský authored at least 8 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Hardness of 4-Colourings G-Colourable Graphs.

Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner

CoRR, April, 2025

Hardness of 4-Colouring k-Colourable Graphs.

Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

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

Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Computing Homotopy Classes for Diagrams.

Marek Filakovský, Lukás Vokrínek

Discret. Comput. Geom., October, 2023

2020

Are Two Given Maps Homotopic? An Algorithmic Viewpoint.

Marek Filakovský, Lukás Vokrínek

Found. Comput. Math., 2020

Embeddability of Simplicial Complexes is Undecidable.

Marek Filakovský, Uli Wagner, Stephan Zhechev

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2018

Computing simplicial representatives of homotopy group elements.

Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev

J. Appl. Comput. Topol., 2018

2017

Computing simplicial representatives of homotopy group element.

Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev

CoRR, 2017