Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z.,https://doi.org/10.1145/3196494.3196534__Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM.https://doi.org/10.1145/3196494.3196534 

Edelsbrunner, H., &; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. Society for Industrial and Applied Mathematics .https://doi.org/10.1137/16M1097201 

Akopyan, A. (2018). On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. Elsevier.https://doi.org/10.1016/j.crma.2018.03.005 

Edelsbrunner, H., &; Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. Institute of Mathematical Statistics.https://doi.org/10.1214/18-AAP1389 

Akopyan, A., &; Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press.https://doi.org/10.1017/fms.2018.7 

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 

Akopyan, A., Avvakumov, S., &; Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv.https://doi.org/10.48550/arXiv.1804.03057 

Biedl, T., Huber, S., &; Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing.https://doi.org/10.1142/S0218195916600050 

Austin, K., &; Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier.https://doi.org/10.1016/j.topol.2016.10.005 

Franek, P., &; Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press.https://doi.org/10.4310/HHA.2017.v19.n2.a16 

Biswas, R., &; Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-59108-7_8 

Edelsbrunner, H., &; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 

Akopyan, A., &; Karasev, R. (2017). A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. Wiley-Blackwell.https://doi.org/10.1112/blms.12062 

Edelsbrunner, H., Nikitenko, A., &; Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. Cambridge University Press.https://doi.org/10.1017/apr.2017.20 

Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:th_873 

Bauer, U., Kerber, M., Reininghaus, J., &; Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. Academic Press.https://doi.org/10.1016/j.jsc.2016.03.008 

Akopyan, A., Bárány, I., &; Robins, S. (2017). Algebraic vertices of non-convex polyhedra. Advances in Mathematics. Academic Press.https://doi.org/10.1016/j.aim.2016.12.026 

Edelsbrunner, H., Glazyrin, A., Musin, O., &; Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. Springer.https://doi.org/10.1007/s00493-016-3308-y 

Bauer, U., &; Edelsbrunner, H. (2017). The Morse theory of cech and delaunay complexes. Transactions of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/tran/6991 

Chatterjee, K., &; Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2017.02.003