Marek Filakovský
Wagner Group
4 Publications
2024 | Conference Paper | IST-REx-ID: 15168 | 
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2020 | Conference Paper | IST-REx-ID: 7806 |
Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
[Published Version]
View
| DOI
| Download Published Version (ext.)
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
2020 | Journal Article | IST-REx-ID: 6563 |
Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.
2018 | Journal Article | IST-REx-ID: 6774 |
Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.
[Published Version]
View
| Files available
| DOI
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.
4 Publications
2024 | Conference Paper | IST-REx-ID: 15168 |
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2020 | Conference Paper | IST-REx-ID: 7806 |
Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
[Published Version]
View
| DOI
| Download Published Version (ext.)
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
2020 | Journal Article | IST-REx-ID: 6563 |
Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.
2018 | Journal Article | IST-REx-ID: 6774 |
Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.
[Published Version]
View
| Files available
| DOI
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.