Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, ACM Transactions on Computation Theory 18 (2026).

Eight-partitioning points in 3D, and efficiently too
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, Discrete &; Computational Geometry (2025).

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.

Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems
G. Tasinato, Topological Methods in Discrete Geometry and Theoretical Computer Sciencef: Measure Partitioning and Constraint Satisfaction Problems, Institute of Science and Technology Austria, 2025.

Eight-partitioning points in 3D, and efficiently too
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15.

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.