Marek Filakovský

5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154
[Published Version] View | Files available | DOI
 
[4]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: 41st International Symposium on Theoretical Aspects of Computer Science. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.STACS.2024.34
[Published Version] View | Files available | DOI | arXiv
 
[3]
2020 | Published | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47
[Published Version] View | DOI | Download Published Version (ext.)
 
[2]
2020 | Published | Journal Article | IST-REx-ID: 6563 | OA
Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Published | Journal Article | IST-REx-ID: 6774 | OA
Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154
[Published Version] View | Files available | DOI
 
[4]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: 41st International Symposium on Theoretical Aspects of Computer Science. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.STACS.2024.34
[Published Version] View | Files available | DOI | arXiv
 
[3]
2020 | Published | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47
[Published Version] View | DOI | Download Published Version (ext.)
 
[2]
2020 | Published | Journal Article | IST-REx-ID: 6563 | OA
Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Published | Journal Article | IST-REx-ID: 6774 | OA
Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed