Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.”10.1145/3196494.3196534__Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.

Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.”10.1137/16M1097201__SIAM J Discrete Math, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:10.1137/16M1097201.

Akopyan, Arseniy. “On the Number of Non-Hexagons in a Planar Tiling.”10.1016/j.crma.2018.03.005__Comptes Rendus Mathematique, vol. 356, no. 4, Elsevier, 2018, pp. 412–14, doi:10.1016/j.crma.2018.03.005.

Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.”10.1214/18-AAP1389__Annals of Applied Probability, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:10.1214/18-AAP1389.

Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.”10.1017/fms.2018.7__Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.

Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.”10.1007/s00454-017-9883-x__Discrete &; Computational Geometry, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.

Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.

Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”10.1142/S0218195916600050__International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.

Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.”10.1016/j.topol.2016.10.005__Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.

Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.”10.4310/HHA.2017.v19.n2.a16__Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.

Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.”10.1007/978-3-319-59108-7_8__Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.

Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.

Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .”10.1112/blms.12062__Bulletin of the London Mathematical Society, vol. 49, no. 4, Wiley-Blackwell, 2017, pp. 690–93, doi:10.1112/blms.12062.

Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.”10.1017/apr.2017.20__Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20.

Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873.

Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.”10.1016/j.jsc.2016.03.008__Journal of Symbolic Computation, vol. 78, Academic Press, 2017, pp. 76–90, doi:10.1016/j.jsc.2016.03.008.

Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.”10.1016/j.aim.2016.12.026__Advances in Mathematics, vol. 308, Academic Press, 2017, pp. 627–44, doi:10.1016/j.aim.2016.12.026.

Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.”10.1007/s00493-016-3308-y__Combinatorica, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:10.1007/s00493-016-3308-y.

Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of cech and Delaunay Complexes.”10.1090/tran/6991__Transactions of the American Mathematical Society, vol. 369, no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:10.1090/tran/6991.

Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.”10.1016/j.ipl.2017.02.003__Information Processing Letters, vol. 122, Elsevier, 2017, pp. 25–29, doi:10.1016/j.ipl.2017.02.003.