4 Publications

Mark all

[4]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.
[Published Version] View | DOI | Download Published Version (ext.)
 
[2]
2020 | Journal Article | IST-REx-ID: 6563 | OA
Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Journal Article | IST-REx-ID: 6774 | OA
Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

4 Publications

Mark all

[4]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.
[Published Version] View | DOI | Download Published Version (ext.)
 
[2]
2020 | Journal Article | IST-REx-ID: 6563 | OA
Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Journal Article | IST-REx-ID: 6774 | OA
Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
[Published Version] View | Files available | DOI
 

Search

Filter Publications