Edelsbrunner, H., &; Ölsböck, K. (2020). Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00188-x 

Kalai, G., &; Patakova, Z. (2020). Intersection patterns of planar sets. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00205-z 

Pach, J., Reed, B., &; Yuditsky, Y. (2020). Almost all string graphs are intersection graphs of plane convex sets. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00213-z 

Pach, J. (2020). A farewell to Ricky Pollack. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00237-5 

Edelsbrunner, H., &; Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. Springer.https://doi.org/10.1007/s00454-018-0049-2 

Akopyan, A., Balitskiy, A., &; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-017-9883-x 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-017-9900-0 

cadek, M., Krcál, M., &; Vokínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-016-9855-6