Tri-partitions and bases of an ordered complex
H. Edelsbrunner, K. Ölsböck, Discrete and Computational Geometry 64 (2020) 759–775.

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

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.

A farewell to Ricky Pollack
J. Pach, Discrete and Computational Geometry 64 (2020) 571–574.

Poisson–Delaunay Mosaics of Order k
H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019) 865–878.

On the circle covering theorem by A.W. Goodman and R.E. Goodman
A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &; Computational Geometry 59 (2018) 1001–1009.

Algorithmic solvability of the lifting extension problem
M. cadek, M. Krcál, L. Vokínek, Discrete &; Computational Geometry 54 (2017) 915–965.

Finding non-orientable surfaces in 3-Manifolds
B. Burton, A.N. de Mesmay, U. Wagner, Discrete &; Computational Geometry 58 (2017) 871–888.