The Wittgenstein Prize

Almost all string graphs are intersection graphs of plane convex sets
J. Pach, B. Reed, Y. Yuditsky, Discrete and Computational Geometry 63 (2020) 888–917.

Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes
G. Vegter, M. Wintraecken, Studia Scientiarum Mathematicarum Hungarica 57 (2020) 193–199.

Folding polyominoes with holes into a cube
O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021).

Crossings between non-homotopic edges
J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.

Erdős-Hajnal-type results for monotone paths
J. Pach, I. Tomon, Journal of Combinatorial Theory. Series B 151 (2021) 21–37.

Counting cells of order-k voronoi tessellations in ℝ³ with morse theory
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

Topological signatures and stability of hexagonal close packing and Barlow stackings
G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.

Depth in arrangements: Dehn–Sommerville–Euler relations with applications
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Leibniz International Proceedings on Mathematics (n.d.).

A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, LIPIcs (n.d.).

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.

A simple algorithm for higher-order Delaunay mosaics and alpha shapes
Edelsbrunner, Herbert, A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica 85. 2023

The beauty of random polytopes inscribed in the 2-sphere
Akopyan, Arseniy, The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics. 2021

A context-aware dimension reduction framework for trajectory and health signal analyses
S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and Humanized Computing 13 (2022) 2621–2635.