Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Oprsal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

Eliminating higher-multiplicity intersections. III. Codimension 2
S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.

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.

Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokínek, Foundations of Computational Mathematics 20 (2020) 311–330.

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.

Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, ArXiv (n.d.).

Stronger counterexamples to the topological Tverberg conjecture
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).

Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).