On the volume of sections of the cube
G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.

Tight frames and related geometric problems
G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.

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.

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.

Bounding radon number via Betti numbers
Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Extending drawings of graphs to arrangements of pseudolines
A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)
U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 2823–2841.

Eliminating higher-multiplicity intersections, III. Codimension 2
S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.

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

Intersection patterns of planar sets
G. Kalai, Z. Patakova, Discrete and Computational Geometry 64 (2020) 304–323.

Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338.

Reconfiguration problems
Z. Masárová, Reconfiguration Problems, Institute of Science and Technology Austria, 2020.

Combinatorial width parameters for 3-dimensional manifolds
K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020.

Topological methods in geometry and discrete mathematics
S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.

Disjoint tree-compatible plane perfect matchings
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.

Z_2-Genus of graphs and minimum rank of partial symmetric matrices
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.

Extending partial representations of circle graphs
S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.

Thrackles: An improved upper bound
R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.