Algorithms for Embeddings and Homotopy Theory
Project Period: 2018-05-01 – 2022-04-30
Funder:
FWF
8 Publications
2024 | Published | 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.
2021 | Published | Journal Article | IST-REx-ID: 10220 |
Eliminating higher-multiplicity intersections. III. Codimension 2
S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.
2020 | Published | 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 | Published | Conference Paper | IST-REx-ID: 7991 |
Homotopic curve shortening and the affine curve-shortening flow
S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version]
View
| Files available
| DOI
| arXiv
S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
2020 | Published | 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.
2019 | Submitted | Preprint | IST-REx-ID: 8182 |
Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, ArXiv (n.d.).
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
S. Avvakumov, S. Kudrya, ArXiv (n.d.).
2019 | Submitted | Preprint | IST-REx-ID: 8184 |
Stronger counterexamples to the topological Tverberg conjecture
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
2019 | Submitted | Preprint | IST-REx-ID: 8185 |
Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
S. Avvakumov, R. Karasev, ArXiv (n.d.).