Braiding geometry and topology to study shapes and data
C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026.

Books, Hallways, and social butterflies: A note on sliding block puzzles
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer 47 (2025) 52–65.

Morse predecomposition of an invariant set
M. Lipiski, K. Mischaikow, M. Mrozek, Qualitative Theory of Dynamical Systems 24 (2025).

Empirical analysis of binding precedent efficiency in Brazilian Supreme Court via case classification
R. Tinarrage, H. Ennes, L. Resck, L.T. Gomes, J.R. Ponciano, J. Poco, Artificial Intelligence and Law (2025).

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

Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers
E. Streltsova, U. Wagner, in:,  41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 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.

LieDetect: Detection of representation orbits of compact Lie groups from point clouds
H. Ennes, R. Tinarrage, Foundations of Computational Mathematics (2025).

The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry 72 (2024) 831–848.

Quantitative Steinitz theorem: A polynomial bound
G. Ivanov, M. Naszódi, Bulletin of the London Mathematical Society 56 (2024) 796–802.

Removing popular faces in curve arrangements
P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, Journal of Graph Algorithms and Applications 28 (2024) 47–82.

Separation of variables for scalar-valued polynomials in the non-stable range
D. Befats, Journal of Algebra 651 (2024) 281–304.

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.

Removing popular faces in curve arrangements
P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, in:, 31st International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 18–33.

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.

A constructive algorithm for building rectifiable curves in weakly convex sets
M. Lopushanski, G. Ivanov, in:, AIP Conference Proceedings, AIP Publishing, 2024.

Divergence of separated nets with respect to displacement equivalence
M. Dymond, V. Kaluza, Geometriae Dedicata 218 (2024).

Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry 69 (2023) 745–770.

Approximating the bundled crossing number
A.M. Arroyo Guevara, S. Felsner, Journal of Graph Algorithms and Applications 27 (2023) 433–457.