Marek Filakovský

12 papers A* 3A 1Journal 8
YearRankTypeTitle / Venue / Authors
2025 A* conf
Hardness of 4-Colouring k-Colourable Graphs.
STOC
Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2025 J jnl
Hardness of 4-Colourings G-Colourable Graphs.
CoRR
Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2024 A conf
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.
STACS
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2023 J jnl
Computing Homotopy Classes for Diagrams.
Discret. Comput. Geom.
Marek Filakovský, Lukás Vokrínek
2023 J jnl
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs.
CoRR
Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2021 J jnl
Computing homotopy classes for diagrams.
CoRR
Marek Filakovský, Lukás Vokrínek
2020 J jnl
Are Two Given Maps Homotopic? An Algorithmic Viewpoint.
Found. Comput. Math.
Marek Filakovský, Lukás Vokrínek
2020 A* conf
Embeddability of Simplicial Complexes is Undecidable.
SODA
Marek Filakovský, Uli Wagner, Stephan Zhechev
2018 A* conf
Computing Simplicial Representatives of Homotopy Group Elements.
SODA
Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2018 J jnl
Computing simplicial representatives of homotopy group elements.
J. Appl. Comput. Topol.
Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2017 J jnl
Computing simplicial representatives of homotopy group element.
CoRR
Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev
2013 J jnl
Are two given maps homotopic? An algorithmic viewpoint.
CoRR
Marek Filakovský, Lukás Vokrínek