[{"main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"page":"750 - 782","quality_controlled":"1","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"oa_version":"Submitted Version","title":"On the optimality of the FCC lattice for soft sphere packing","publication_status":"published","_id":"312","scopus_import":"1","doi":"10.1137/16M1097201","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham","first_name":"Mabel"}],"date_created":"2018-12-11T11:45:46Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"date_published":"2018-03-29T00:00:00Z","citation":{"ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018."},"intvolume":"        32","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","publication_identifier":{"issn":["0895-4801"]},"volume":32,"article_type":"original","status":"public","external_id":{"isi":["000428958900038"]},"publication":"SIAM J Discrete Math","isi":1,"department":[{"_id":"HeEd"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"date_updated":"2026-04-16T09:53:02Z","month":"03","publisher":"Society for Industrial and Applied Mathematics ","day":"29","publist_id":"7553","issue":"1","year":"2018","type":"journal_article","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}]},{"external_id":{"isi":["000432205500011"]},"status":"public","article_processing_charge":"Yes (via OA deal)","publication":"Discrete & Computational Geometry","has_accepted_license":"1","isi":1,"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"2018_DiscreteComp_Akopyan.pdf","file_id":"5844","date_created":"2019-01-18T09:27:36Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2019-01-18T09:27:36Z","file_size":482518,"success":1}],"ddc":["516","000"],"date_updated":"2026-05-20T10:19:33Z","publisher":"Springer","corr_author":"1","month":"06","day":"01","issue":"4","publist_id":"6324","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","year":"2018","page":"1001-1009","file_date_updated":"2019-01-18T09:27:36Z","quality_controlled":"1","abstract":[{"text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.","lang":"eng"}],"publication_status":"published","oa_version":"Published Version","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","author":[{"first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Balitskiy, Alexey","first_name":"Alexey","last_name":"Balitskiy"},{"full_name":"Grigorev, Mikhail","last_name":"Grigorev","first_name":"Mikhail"}],"date_created":"2018-12-11T11:49:57Z","doi":"10.1007/s00454-017-9883-x","_id":"1064","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","oa":1,"citation":{"apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>.","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        59","volume":59,"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"article_type":"original"},{"acknowledgement":"This research is partially supported by the Russian Government under the Mega Project 11.G34.31.0053, by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by RFBR grant 11-01-00735, and by NSF grants DMS-1101688, DMS-1400876.","intvolume":"        37","volume":37,"publication_identifier":{"issn":["0209-9683"]},"scopus_import":"1","_id":"1173","date_created":"2018-12-11T11:50:32Z","doi":"10.1007/s00493-016-3308-y","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Glazyrin","first_name":"Alexey","full_name":"Glazyrin, Alexey"},{"last_name":"Musin","first_name":"Oleg","full_name":"Musin, Oleg"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","orcid":"0000-0002-0659-3201","last_name":"Nikitenko"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"citation":{"mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>.","chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>.","short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.","ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. 2017;37(5):887-910. doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>","apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., &#38; Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>","ista":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” <i>Combinatorica</i>, vol. 37, no. 5. Springer, pp. 887–910, 2017."},"oa":1,"date_published":"2017-10-01T00:00:00Z","abstract":[{"lang":"eng","text":"We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions."}],"oa_version":"Submitted Version","title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.6337"}],"page":"887 - 910","quality_controlled":"1","ec_funded":1,"year":"2017","type":"journal_article","project":[{"name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"month":"10","publisher":"Springer","day":"01","issue":"5","publist_id":"6182","language":[{"iso":"eng"}],"date_updated":"2025-06-04T08:44:44Z","status":"public","external_id":{"arxiv":["1411.6337"],"isi":["000418056000005"]},"department":[{"_id":"HeEd"}],"isi":1,"publication":"Combinatorica","article_processing_charge":"No"},{"ec_funded":1,"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","year":"2017","publisher":"Academic Press","month":"02","day":"21","publist_id":"6173","language":[{"iso":"eng"}],"date_updated":"2025-06-04T08:45:48Z","external_id":{"arxiv":["1508.07594"],"isi":["000409292900015"]},"status":"public","article_processing_charge":"No","publication":"Advances in Mathematics","isi":1,"department":[{"_id":"HeEd"}],"intvolume":"       308","volume":308,"publication_identifier":{"issn":["0001-8708"]},"author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X"},{"full_name":"Bárány, Imre","first_name":"Imre","last_name":"Bárány"},{"last_name":"Robins","first_name":"Sinai","full_name":"Robins, Sinai"}],"date_created":"2018-12-11T11:50:34Z","doi":"10.1016/j.aim.2016.12.026","_id":"1180","scopus_import":"1","oa":1,"date_published":"2017-02-21T00:00:00Z","citation":{"ieee":"A. Akopyan, I. Bárány, and S. Robins, “Algebraic vertices of non-convex polyhedra,” <i>Advances in Mathematics</i>, vol. 308. Academic Press, pp. 627–644, 2017.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644.","apa":"Akopyan, A., Bárány, I., &#38; Robins, S. (2017). Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>","ama":"Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. 2017;308:627-644. doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>","chicago":"Akopyan, Arseniy, Imre Bárány, and Sinai Robins. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>.","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","mla":"Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>, vol. 308, Academic Press, 2017, pp. 627–44, doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>."},"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform.","lang":"eng"}],"publication_status":"published","title":"Algebraic vertices of non-convex polyhedra","oa_version":"Submitted Version","page":"627 - 644","main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"quality_controlled":"1"},{"acknowledgement":"Michael Kerber acknowledges support by the Max Planck Center for Visual Computing and Communications (FKZ-01IMC01 and FKZ-01IM10001). Ulrich Bauer, Jan Reininghaus, and Hubert Wagner acknowledge support by the EU Project TOPOSYS (FP7-ICT-318493-STREP).","intvolume":"        78","article_type":"original","publication_identifier":{"issn":[" 0747-7171"]},"volume":78,"scopus_import":"1","_id":"1433","author":[{"last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert"}],"date_created":"2018-12-11T11:51:59Z","doi":"10.1016/j.jsc.2016.03.008","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. 2017;78:76-90. doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.","mla":"Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>, vol. 78, Academic Press, 2017, pp. 76–90, doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” <i>Journal of Symbolic Computation</i>, vol. 78. Academic Press, pp. 76–90, 2017.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90."},"date_published":"2017-01-01T00:00:00Z","oa":1,"abstract":[{"text":"Phat is an open-source C. ++ library for the computation of persistent homology by matrix reduction, targeted towards developers of software for topological data analysis. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. We provide numerous different reduction strategies as well as data types to store and manipulate the boundary matrix. We compare the different combinations through extensive experimental evaluation and identify optimization techniques that work well in practical situations. We also compare our software with various other publicly available libraries for persistent homology.","lang":"eng"}],"oa_version":"Published Version","title":"Phat - Persistent homology algorithms toolbox","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.1016/j.jsc.2016.03.008","open_access":"1"}],"page":"76 - 90","quality_controlled":"1","ec_funded":1,"year":"2017","type":"journal_article","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"month":"01","corr_author":"1","publisher":"Academic Press","OA_type":"free access","publist_id":"5765","day":"01","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"10894","status":"public","relation":"earlier_version"}]},"date_updated":"2025-10-01T07:39:51Z","status":"public","external_id":{"isi":["000384396000005"]},"department":[{"_id":"HeEd"}],"isi":1,"publication":"Journal of Symbolic Computation","article_processing_charge":"No"},{"ddc":["000"],"date_updated":"2025-07-10T11:49:53Z","file":[{"relation":"main_file","file_id":"4998","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf","access_level":"open_access","creator":"system","file_size":247657,"date_updated":"2019-10-15T07:44:51Z","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"HeEd"}],"has_accepted_license":"1","isi":1,"publication":"Information Processing Letters","external_id":{"isi":["000399506600005"]},"status":"public","pubrep_id":"991","type":"journal_article","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"year":"2017","ec_funded":1,"day":"01","publist_id":"6323","publisher":"Elsevier","month":"06","publication_status":"published","oa_version":"Submitted Version","title":"Pushdown reachability with constant treewidth","abstract":[{"lang":"eng","text":"We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs."}],"file_date_updated":"2019-10-15T07:44:51Z","quality_controlled":"1","page":"25 - 29","volume":122,"publication_identifier":{"issn":["0020-0190"]},"intvolume":"       122","citation":{"ista":"Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.","ieee":"K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” <i>Information Processing Letters</i>, vol. 122. Elsevier, pp. 25–29, 2017.","ama":"Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. 2017;122:25-29. doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>","mla":"Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>, vol. 122, Elsevier, 2017, pp. 25–29, doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>.","chicago":"Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>.","short":"K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.","apa":"Chatterjee, K., &#38; Osang, G. F. (2017). Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>"},"date_published":"2017-06-01T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:57Z","doi":"10.1016/j.ipl.2017.02.003","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"1065"},{"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1312.1231","open_access":"1"}],"page":"3741 - 3762","title":"The Morse theory of Čech and delaunay complexes","oa_version":"Preprint","publication_status":"published","abstract":[{"text":"Given a finite set of points in Rn and a radius parameter, we study the Čech, Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four complexes are simple-homotopy equivalent by a sequence of simplicial collapses, which are explicitly described by a single discrete gradient field.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","arxiv":1,"citation":{"ista":"Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes. Transactions of the American Mathematical Society. 369(5), 3741–3762.","ieee":"U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,” <i>Transactions of the American Mathematical Society</i>, vol. 369, no. 5. American Mathematical Society, pp. 3741–3762, 2017.","ama":"Bauer U, Edelsbrunner H. The Morse theory of Čech and delaunay complexes. <i>Transactions of the American Mathematical Society</i>. 2017;369(5):3741-3762. doi:<a href=\"https://doi.org/10.1090/tran/6991\">10.1090/tran/6991</a>","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/tran/6991\">https://doi.org/10.1090/tran/6991</a>.","short":"U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society 369 (2017) 3741–3762.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” <i>Transactions of the American Mathematical Society</i>, vol. 369, no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:<a href=\"https://doi.org/10.1090/tran/6991\">10.1090/tran/6991</a>.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2017). The Morse theory of Čech and delaunay complexes. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/6991\">https://doi.org/10.1090/tran/6991</a>"},"oa":1,"date_published":"2017-05-01T00:00:00Z","scopus_import":"1","_id":"1072","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_created":"2018-12-11T11:49:59Z","doi":"10.1090/tran/6991","article_type":"original","volume":369,"acknowledgement":"This research has been supported by the EU project Toposys(FP7-ICT-318493-STREP), by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”.","intvolume":"       369","isi":1,"department":[{"_id":"HeEd"}],"publication":"Transactions of the American Mathematical Society","article_processing_charge":"No","status":"public","external_id":{"arxiv":["1312.1231"],"isi":["000398030400024"]},"date_updated":"2025-04-15T08:37:54Z","language":[{"iso":"eng"}],"issue":"5","day":"01","publist_id":"6311","month":"05","publisher":"American Mathematical Society","year":"2017","type":"journal_article","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493"}],"ec_funded":1},{"publist_id":"6373","issue":"4","day":"01","publisher":"Oxford University Press","month":"01","type":"journal_article","year":"2017","article_processing_charge":"No","publication":"Monthly Notices of the Royal Astronomical Society","isi":1,"department":[{"_id":"HeEd"}],"external_id":{"arxiv":["1608.04519"],"isi":["000395170200039"]},"status":"public","date_updated":"2025-06-04T08:10:31Z","language":[{"iso":"eng"}],"date_published":"2017-01-01T00:00:00Z","oa":1,"citation":{"ama":"Pranav P, Edelsbrunner H, Van De Weygaert R, et al. The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;465(4):4281-4310. doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>","short":"P. Pranav, H. Edelsbrunner, R. Van De Weygaert, G. Vegter, M. Kerber, B. Jones, M. Wintraecken, Monthly Notices of the Royal Astronomical Society 465 (2017) 4281–4310.","chicago":"Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter, Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>.","mla":"Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>.","apa":"Pranav, P., Edelsbrunner, H., Van De Weygaert, R., Vegter, G., Kerber, M., Jones, B., &#38; Wintraecken, M. (2017). The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>","ista":"Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.","ieee":"P. Pranav <i>et al.</i>, “The topology of the cosmic web in terms of persistent Betti numbers,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4. Oxford University Press, pp. 4281–4310, 2017."},"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Pratyush","last_name":"Pranav","full_name":"Pranav, Pratyush"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"last_name":"Van De Weygaert","first_name":"Rien","full_name":"Van De Weygaert, Rien"},{"last_name":"Vegter","first_name":"Gert","full_name":"Vegter, Gert"},{"last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"},{"first_name":"Bernard","last_name":"Jones","full_name":"Jones, Bernard"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","first_name":"Mathijs"}],"doi":"10.1093/mnras/stw2862","date_created":"2018-12-11T11:49:44Z","_id":"1022","scopus_import":"1","publication_identifier":{"issn":["0035-8711"]},"volume":465,"intvolume":"       465","acknowledgement":"Part of this work has been supported by the 7th Framework Programme for Research of the European Commission, under FETOpen grant number 255827 (CGL Computational Geometry Learning) and ERC advanced grant, URSAT (Understanding Random Systems via Algebraic Topology) number 320422.","quality_controlled":"1","page":"4281 - 4310","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.04519"}],"publication_status":"published","oa_version":"Submitted Version","title":"The topology of the cosmic web in terms of persistent Betti numbers","abstract":[{"text":"We introduce a multiscale topological description of the Megaparsec web-like cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of its multiscale arrangement of matter and galaxies. Emanating from algebraic topology and Morse theory, Betti numbers and persistence diagrams represent an extension and deepening of the cosmologically familiar topological genus measure and the related geometric Minkowski functionals. In addition to a description of the mathematical background, this study presents the computational procedure for computing Betti numbers and persistence diagrams for density field filtrations. The field may be computed starting from a discrete spatial distribution of galaxies or simulation particles. The main emphasis of this study concerns an extensive and systematic exploration of the imprint of different web-like morphologies and different levels of multiscale clustering in the corresponding computed Betti numbers and persistence diagrams. To this end, we use Voronoi clustering models as templates for a rich variety of web-like configurations and the fractal-like Soneira-Peebles models exemplify a range of multiscale configurations. We have identified the clear imprint of cluster nodes, filaments, walls, and voids in persistence diagrams, along with that of the nested hierarchy of structures in multiscale point distributions. We conclude by outlining the potential of persistent topology for understanding the connectivity structure of the cosmic web, in large simulations of cosmic structure formation and in the challenging context of the observed galaxy distribution in large galaxy surveys.","lang":"eng"}]},{"quality_controlled":"1","page":"397 - 409","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02045"}],"publication_status":"published","title":"Streaming algorithm for Euler characteristic curves of multidimensional images","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams."}],"arxiv":1,"citation":{"apa":"Heiss, T., &#38; Wagner, H. (2017). Streaming algorithm for Euler characteristic curves of multidimensional images. In M. Felsberg, A. Heyden, &#38; N. Krüger (Eds.) (Vol. 10424, pp. 397–409). Presented at the CAIP: Computer Analysis of Images and Patterns, Ystad, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">https://doi.org/10.1007/978-3-319-64689-3_32</a>","ama":"Heiss T, Wagner H. Streaming algorithm for Euler characteristic curves of multidimensional images. In: Felsberg M, Heyden A, Krüger N, eds. Vol 10424. Springer; 2017:397-409. doi:<a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">10.1007/978-3-319-64689-3_32</a>","chicago":"Heiss, Teresa, and Hubert Wagner. “Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images.” edited by Michael Felsberg, Anders Heyden, and Norbert Krüger, 10424:397–409. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">https://doi.org/10.1007/978-3-319-64689-3_32</a>.","mla":"Heiss, Teresa, and Hubert Wagner. <i>Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images</i>. Edited by Michael Felsberg et al., vol. 10424, Springer, 2017, pp. 397–409, doi:<a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">10.1007/978-3-319-64689-3_32</a>.","short":"T. Heiss, H. Wagner, in:, M. Felsberg, A. Heyden, N. Krüger (Eds.), Springer, 2017, pp. 397–409.","ieee":"T. Heiss and H. Wagner, “Streaming algorithm for Euler characteristic curves of multidimensional images,” presented at the CAIP: Computer Analysis of Images and Patterns, Ystad, Sweden, 2017, vol. 10424, pp. 397–409.","ista":"Heiss T, Wagner H. 2017. Streaming algorithm for Euler characteristic curves of multidimensional images. CAIP: Computer Analysis of Images and Patterns, LNCS, vol. 10424, 397–409."},"date_published":"2017-07-28T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:45Z","doi":"10.1007/978-3-319-64689-3_32","author":[{"id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","full_name":"Heiss, Teresa","last_name":"Heiss","orcid":"0000-0002-1780-2689","first_name":"Teresa"},{"first_name":"Hubert","last_name":"Wagner","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"833","alternative_title":["LNCS"],"publication_identifier":{"issn":["0302-9743"]},"volume":10424,"intvolume":"     10424","article_processing_charge":"No","department":[{"_id":"HeEd"}],"isi":1,"external_id":{"arxiv":["1705.02045"],"isi":["000432085900032"]},"status":"public","date_updated":"2025-06-04T09:54:22Z","editor":[{"full_name":"Felsberg, Michael","first_name":"Michael","last_name":"Felsberg"},{"full_name":"Heyden, Anders","last_name":"Heyden","first_name":"Anders"},{"full_name":"Krüger, Norbert","first_name":"Norbert","last_name":"Krüger"}],"language":[{"iso":"eng"}],"publist_id":"6815","day":"28","publisher":"Springer","conference":{"start_date":"2017-08-22","name":"CAIP: Computer Analysis of Images and Patterns","end_date":"2017-08-24","location":"Ystad, Sweden"},"month":"07","corr_author":"1","type":"conference","year":"2017"},{"intvolume":"       198","alternative_title":["PROMS"],"volume":198,"publication_identifier":{"isbn":["978-331956930-7"]},"scopus_import":"1","_id":"836","doi":"10.1007/978-3-319-56932-1_8","author":[{"full_name":"Ethier, Marc","last_name":"Ethier","first_name":"Marc"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz","last_name":"Jablonski","orcid":"0000-0002-3536-9866","first_name":"Grzegorz"},{"first_name":"Marian","last_name":"Mrozek","full_name":"Mrozek, Marian"}],"date_created":"2018-12-11T11:48:46Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. Ethier, G. Jablonski, and M. Mrozek, “Finding eigenvalues of self-maps with the Kronecker canonical form,” in <i>Special Sessions in Applications of Computer Algebra</i>, Kalamata, Greece, 2017, vol. 198, pp. 119–136.","ista":"Ethier M, Jablonski G, Mrozek M. 2017. Finding eigenvalues of self-maps with the Kronecker canonical form. Special Sessions in Applications of Computer Algebra. ACA: Applications of Computer Algebra, PROMS, vol. 198, 119–136.","apa":"Ethier, M., Jablonski, G., &#38; Mrozek, M. (2017). Finding eigenvalues of self-maps with the Kronecker canonical form. In <i>Special Sessions in Applications of Computer Algebra</i> (Vol. 198, pp. 119–136). Kalamata, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56932-1_8\">https://doi.org/10.1007/978-3-319-56932-1_8</a>","ama":"Ethier M, Jablonski G, Mrozek M. Finding eigenvalues of self-maps with the Kronecker canonical form. In: <i>Special Sessions in Applications of Computer Algebra</i>. Vol 198. Springer; 2017:119-136. doi:<a href=\"https://doi.org/10.1007/978-3-319-56932-1_8\">10.1007/978-3-319-56932-1_8</a>","short":"M. Ethier, G. Jablonski, M. Mrozek, in:, Special Sessions in Applications of Computer Algebra, Springer, 2017, pp. 119–136.","chicago":"Ethier, Marc, Grzegorz Jablonski, and Marian Mrozek. “Finding Eigenvalues of Self-Maps with the Kronecker Canonical Form.” In <i>Special Sessions in Applications of Computer Algebra</i>, 198:119–36. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56932-1_8\">https://doi.org/10.1007/978-3-319-56932-1_8</a>.","mla":"Ethier, Marc, et al. “Finding Eigenvalues of Self-Maps with the Kronecker Canonical Form.” <i>Special Sessions in Applications of Computer Algebra</i>, vol. 198, Springer, 2017, pp. 119–36, doi:<a href=\"https://doi.org/10.1007/978-3-319-56932-1_8\">10.1007/978-3-319-56932-1_8</a>."},"date_published":"2017-07-27T00:00:00Z","abstract":[{"lang":"eng","text":"Recent research has examined how to study the topological features of a continuous self-map by means of the persistence of the eigenspaces, for given eigenvalues, of the endomorphism induced in homology over a field. This raised the question of how to select dynamically significant eigenvalues. The present paper aims to answer this question, giving an algorithm that computes the persistence of eigenspaces for every eigenvalue simultaneously, also expressing said eigenspaces as direct sums of “finite” and “singular” subspaces."}],"title":"Finding eigenvalues of self-maps with the Kronecker canonical form","oa_version":"None","publication_status":"published","page":"119 - 136","quality_controlled":"1","ec_funded":1,"year":"2017","type":"conference","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7"}],"month":"07","publisher":"Springer","conference":{"location":"Kalamata, Greece","name":"ACA: Applications of Computer Algebra","start_date":"2015-07-20","end_date":"2015-07-23"},"day":"27","publist_id":"6812","language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:37:55Z","status":"public","external_id":{"isi":["000434088200008"]},"isi":1,"department":[{"_id":"HeEd"}],"publication":"Special Sessions in Applications of Computer Algebra","article_processing_charge":"No"},{"status":"public","page":"1709 - 1735","quality_controlled":"1","department":[{"_id":"HeEd"}],"publication":"Handbook of Discrete and Computational Geometry, Third Edition","article_processing_charge":"No","abstract":[{"text":"The advent of high-throughput technologies and the concurrent advances in information sciences have led to a data revolution in biology. This revolution is most significant in molecular biology, with an increase in the number and scale of the “omics” projects over the last decade. Genomics projects, for example, have produced impressive advances in our knowledge of the information concealed into genomes, from the many genes that encode for the proteins that are responsible for most if not all cellular functions, to the noncoding regions that are now known to provide regulatory functions. Proteomics initiatives help to decipher the role of post-translation modifications on the protein structures and provide maps of protein-protein interactions, while functional genomics is the field that attempts to make use of the data produced by these projects to understand protein functions. The biggest challenge today is to assimilate the wealth of information provided by these initiatives into a conceptual framework that will help us decipher life. For example, the current views of the relationship between protein structure and function remain fragmented. We know of their sequences, more and more about their structures, we have information on their biological activities, but we have difficulties connecting this dotted line into an informed whole. We lack the experimental and computational tools for directly studying protein structure, function, and dynamics at the molecular and supra-molecular levels. In this chapter, we review some of the current developments in building the computational tools that are needed, focusing on the role that geometry and topology play in these efforts. One of our goals is to raise the general awareness about the importance of geometric methods in elucidating the mysterious foundations of our very existence. Another goal is the broadening of what we consider a geometric algorithm. There is plenty of valuable no-man’s-land between combinatorial and numerical algorithms, and it seems opportune to explore this land with a computational-geometric frame of mind.","lang":"eng"}],"language":[{"iso":"eng"}],"editor":[{"full_name":"Toth, Csaba","last_name":"Toth","first_name":"Csaba"},{"last_name":"O'Rourke","first_name":"Joseph","full_name":"O'Rourke, Joseph"},{"first_name":"Jacob","last_name":"Goodman","full_name":"Goodman, Jacob"}],"title":"Computational topology for structural molecular biology","oa_version":"None","date_updated":"2023-10-16T11:15:22Z","series_title":"Handbook of Discrete and Computational Geometry","publication_status":"published","scopus_import":"1","month":"11","_id":"84","publisher":"Taylor & Francis","date_created":"2018-12-11T11:44:32Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Koehl, Patrice","last_name":"Koehl","first_name":"Patrice"}],"doi":"10.1201/9781315119601","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7970","day":"09","citation":{"mla":"Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” <i>Handbook of Discrete and Computational Geometry, Third Edition</i>, edited by Csaba Toth et al., Taylor &#38; Francis, 2017, pp. 1709–35, doi:<a href=\"https://doi.org/10.1201/9781315119601\">10.1201/9781315119601</a>.","chicago":"Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” In <i>Handbook of Discrete and Computational Geometry, Third Edition</i>, edited by Csaba Toth, Joseph O’Rourke, and Jacob Goodman, 1709–35. Handbook of Discrete and Computational Geometry. Taylor &#38; Francis, 2017. <a href=\"https://doi.org/10.1201/9781315119601\">https://doi.org/10.1201/9781315119601</a>.","short":"H. Edelsbrunner, P. Koehl, in:, C. Toth, J. O’Rourke, J. Goodman (Eds.), Handbook of Discrete and Computational Geometry, Third Edition, Taylor &#38; Francis, 2017, pp. 1709–1735.","ama":"Edelsbrunner H, Koehl P. Computational topology for structural molecular biology. In: Toth C, O’Rourke J, Goodman J, eds. <i>Handbook of Discrete and Computational Geometry, Third Edition</i>. Handbook of Discrete and Computational Geometry. Taylor &#38; Francis; 2017:1709-1735. doi:<a href=\"https://doi.org/10.1201/9781315119601\">10.1201/9781315119601</a>","apa":"Edelsbrunner, H., &#38; Koehl, P. (2017). Computational topology for structural molecular biology. In C. Toth, J. O’Rourke, &#38; J. Goodman (Eds.), <i>Handbook of Discrete and Computational Geometry, Third Edition</i> (pp. 1709–1735). Taylor &#38; Francis. <a href=\"https://doi.org/10.1201/9781315119601\">https://doi.org/10.1201/9781315119601</a>","ista":"Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular biology. In: Handbook of Discrete and Computational Geometry, Third Edition. , 1709–1735.","ieee":"H. Edelsbrunner and P. Koehl, “Computational topology for structural molecular biology,” in <i>Handbook of Discrete and Computational Geometry, Third Edition</i>, C. Toth, J. O’Rourke, and J. Goodman, Eds. Taylor &#38; Francis, 2017, pp. 1709–1735."},"date_published":"2017-11-09T00:00:00Z","year":"2017","publication_identifier":{"eisbn":["9781498711425"]},"type":"book_chapter"},{"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1605.07997","open_access":"1"}],"page":"588 - 596","oa_version":"Submitted Version","title":"On the lengths of curves passing through boundary points of a planar convex shape","publication_status":"published","abstract":[{"lang":"eng","text":"We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that, for any convex shape K, there exist four points on the boundary of K such that the length of any curve passing through these points is at least half of the perimeter of K. It is also shown that the same statement does not remain valid with the additional constraint that the points are extreme points of K. Moreover, the factor &amp;#xbd; cannot be achieved with any fixed number of extreme points. We conclude the paper with a few other inequalities related to the perimeter of a convex shape."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_published":"2017-01-01T00:00:00Z","arxiv":1,"citation":{"ieee":"A. Akopyan and V. Vysotsky, “On the lengths of curves passing through boundary points of a planar convex shape,” <i>The American Mathematical Monthly</i>, vol. 124, no. 7. Mathematical Association of America, pp. 588–596, 2017.","ista":"Akopyan A, Vysotsky V. 2017. On the lengths of curves passing through boundary points of a planar convex shape. The American Mathematical Monthly. 124(7), 588–596.","apa":"Akopyan, A., &#38; Vysotsky, V. (2017). On the lengths of curves passing through boundary points of a planar convex shape. <i>The American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">https://doi.org/10.4169/amer.math.monthly.124.7.588</a>","mla":"Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing through Boundary Points of a Planar Convex Shape.” <i>The American Mathematical Monthly</i>, vol. 124, no. 7, Mathematical Association of America, 2017, pp. 588–96, doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">10.4169/amer.math.monthly.124.7.588</a>.","chicago":"Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing through Boundary Points of a Planar Convex Shape.” <i>The American Mathematical Monthly</i>. Mathematical Association of America, 2017. <a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">https://doi.org/10.4169/amer.math.monthly.124.7.588</a>.","short":"A. Akopyan, V. Vysotsky, The American Mathematical Monthly 124 (2017) 588–596.","ama":"Akopyan A, Vysotsky V. On the lengths of curves passing through boundary points of a planar convex shape. <i>The American Mathematical Monthly</i>. 2017;124(7):588-596. doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.124.7.588\">10.4169/amer.math.monthly.124.7.588</a>"},"_id":"909","scopus_import":"1","doi":"10.4169/amer.math.monthly.124.7.588","author":[{"first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vysotsky, Vladislav","first_name":"Vladislav","last_name":"Vysotsky"}],"date_created":"2018-12-11T11:49:09Z","volume":124,"publication_identifier":{"issn":["0002-9890"]},"article_type":"original","intvolume":"       124","publication":"The American Mathematical Monthly","department":[{"_id":"HeEd"}],"isi":1,"article_processing_charge":"No","status":"public","external_id":{"arxiv":["1605.07997"],"isi":["000413947300002"]},"date_updated":"2025-07-10T12:01:35Z","language":[{"iso":"eng"}],"issue":"7","day":"01","publist_id":"6534","month":"01","publisher":"Mathematical Association of America","year":"2017","type":"journal_article","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"ec_funded":1},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"date_published":"2017-04-13T00:00:00Z","citation":{"ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2017). Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. 2017;26(3-4):211-229. doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2017. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229."},"_id":"481","scopus_import":1,"doi":"10.1142/S0218195916600050","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814"},{"last_name":"Palfrader","first_name":"Peter","full_name":"Palfrader, Peter"}],"date_created":"2018-12-11T11:46:43Z","volume":26,"intvolume":"        26","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","page":"211 - 229","oa_version":"Published Version","title":"Planar matchings for weighted straight skeletons","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"issue":"3-4","day":"13","publist_id":"7338","corr_author":"1","month":"04","publisher":"World Scientific Publishing","year":"2017","type":"journal_article","pubrep_id":"949","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"publication":"International Journal of Computational Geometry and Applications","has_accepted_license":"1","department":[{"_id":"HeEd"}],"status":"public","ddc":["004","514","516"],"file":[{"content_type":"application/pdf","file_size":769296,"date_updated":"2020-07-14T12:46:35Z","relation":"main_file","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","file_id":"4758","date_created":"2018-12-12T10:09:34Z","access_level":"open_access","creator":"system"}],"date_updated":"2025-09-29T13:22:54Z","related_material":{"record":[{"id":"10892","status":"public","relation":"earlier_version"}]},"language":[{"iso":"eng"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2017-01-01T00:00:00Z","oa":1,"arxiv":1,"citation":{"apa":"Austin, K., &#38; Virk, Z. (2017). Higson compactification and dimension raising. <i>Topology and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>","ama":"Austin K, Virk Z. Higson compactification and dimension raising. <i>Topology and its Applications</i>. 2017;215:45-57. doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>, vol. 215, Elsevier, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>.","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>.","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” <i>Topology and its Applications</i>, vol. 215. Elsevier, pp. 45–57, 2017.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57."},"_id":"521","scopus_import":"1","doi":"10.1016/j.topol.2016.10.005","author":[{"first_name":"Kyle","last_name":"Austin","full_name":"Austin, Kyle"},{"full_name":"Virk, Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","last_name":"Virk"}],"date_created":"2018-12-11T11:46:56Z","volume":215,"publication_identifier":{"issn":["0166-8641"]},"intvolume":"       215","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954","open_access":"1"}],"page":"45 - 57","title":"Higson compactification and dimension raising","oa_version":"Submitted Version","publication_status":"published","abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"publist_id":"7299","day":"01","corr_author":"1","month":"01","publisher":"Elsevier","year":"2017","type":"journal_article","publication":"Topology and its Applications","department":[{"_id":"HeEd"}],"isi":1,"article_processing_charge":"No","status":"public","external_id":{"isi":["000390501400005"],"arxiv":["1608.03954"]},"date_updated":"2025-09-18T09:47:04Z","language":[{"iso":"eng"}]},{"publisher":"International Press","month":"01","corr_author":"1","day":"01","publist_id":"7246","issue":"2","ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","call_identifier":"H2020"}],"type":"journal_article","year":"2017","external_id":{"arxiv":["1507.04310"],"isi":["000440749400010"]},"status":"public","article_processing_charge":"No","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"isi":1,"publication":"Homology, Homotopy and Applications","language":[{"iso":"eng"}],"date_updated":"2025-09-11T07:41:51Z","author":[{"full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Franek","orcid":"0000-0001-8878-8397"},{"first_name":"Marek","last_name":"Krcál","full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:47:14Z","doi":"10.4310/HHA.2017.v19.n2.a16","scopus_import":"1","_id":"568","citation":{"ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2. International Press, pp. 313–342, 2017.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","apa":"Franek, P., &#38; Krcál, M. (2017). Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. International Press. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>.","ama":"Franek P, Krcál M. Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. 2017;19(2):313-342. doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>"},"arxiv":1,"date_published":"2017-01-01T00:00:00Z","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        19","volume":19,"publication_identifier":{"issn":["1532-0073"]},"page":"313 - 342","main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"quality_controlled":"1","abstract":[{"text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z&lt; r(f) := (g-1(0): ||g - f|| &lt; r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z&lt; r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r &gt; 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).","lang":"eng"}],"publication_status":"published","title":"Persistence of zero sets","oa_version":"Submitted Version"},{"quality_controlled":"1","page":"93-104","oa_version":"None","title":"Construction of persistent Voronoi diagram on 3D digital plane","publication_status":"published","abstract":[{"text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept.","lang":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in <i>Combinatorial image analysis</i>, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” <i>Combinatorial Image Analysis</i>, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:<a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">10.1007/978-3-319-59108-7_8</a>.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In <i>Combinatorial Image Analysis</i>, 10256:93–104. Cham: Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">https://doi.org/10.1007/978-3-319-59108-7_8</a>.","ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: <i>Combinatorial Image Analysis</i>. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:<a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">10.1007/978-3-319-59108-7_8</a>","apa":"Biswas, R., &#38; Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In <i>Combinatorial image analysis</i> (Vol. 10256, pp. 93–104). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">https://doi.org/10.1007/978-3-319-59108-7_8</a>"},"date_published":"2017-05-17T00:00:00Z","_id":"5803","date_created":"2019-01-08T20:42:56Z","extern":"1","doi":"10.1007/978-3-319-59108-7_8","author":[{"orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"volume":10256,"intvolume":"     10256","department":[{"_id":"HeEd"}],"publication":"Combinatorial image analysis","article_processing_charge":"No","status":"public","date_updated":"2022-01-28T07:48:24Z","place":"Cham","language":[{"iso":"eng"}],"day":"17","month":"05","publisher":"Springer Nature","conference":{"end_date":"2017-06-21","start_date":"2017-06-19","name":"IWCIA: International Workshop on Combinatorial Image Analysis","location":"Plovdiv, Bulgaria"},"year":"2017","type":"book_chapter"},{"language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf","date_created":"2018-12-12T10:11:03Z","file_id":"4856","checksum":"067ab0cb3f962bae6c3af6bf0094e0f3","creator":"system","access_level":"open_access","content_type":"application/pdf","file_size":990546,"date_updated":"2020-07-14T12:47:42Z"}],"date_updated":"2025-07-10T11:53:56Z","ddc":["514","516"],"status":"public","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","pubrep_id":"895","year":"2017","conference":{"end_date":"2017-07-07","name":"Symposium on Computational Geometry, SoCG","start_date":"2017-07-04","location":"Brisbane, Australia"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","corr_author":"1","month":"06","day":"01","publist_id":"7021","abstract":[{"text":"We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. ","lang":"eng"}],"publication_status":"published","title":"Topological data analysis with Bregman divergences","oa_version":"Published Version","page":"391-3916","file_date_updated":"2020-07-14T12:47:42Z","quality_controlled":"1","intvolume":"        77","publication_identifier":{"issn":["1868-8969"]},"volume":77,"alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.SoCG.2017.39","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","last_name":"Wagner"}],"date_created":"2018-12-11T11:47:56Z","_id":"688","scopus_import":"1","oa":1,"date_published":"2017-06-01T00:00:00Z","citation":{"ieee":"H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916.","ista":"Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.","apa":"Edelsbrunner, H., &#38; 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. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>","ama":"Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>","chicago":"Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.","mla":"Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>.","short":"H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2017","type":"journal_article","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"ec_funded":1,"publist_id":"6982","day":"01","issue":"4","month":"08","corr_author":"1","publisher":"Wiley","date_updated":"2025-09-10T11:04:43Z","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"isi":1,"publication":"Bulletin of the London Mathematical Society","article_processing_charge":"No","status":"public","external_id":{"arxiv":["1608.06279"],"isi":["000407045900012"]},"publication_identifier":{"issn":["0024-6093"]},"volume":49,"intvolume":"        49","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"citation":{"ieee":"A. Akopyan and R. Karasev, “A tight estimate for the waist of the ball ,” <i>Bulletin of the London Mathematical Society</i>, vol. 49, no. 4. Wiley, pp. 690–693, 2017.","ista":"Akopyan A, Karasev R. 2017. A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. 49(4), 690–693.","apa":"Akopyan, A., &#38; Karasev, R. (2017). A tight estimate for the waist of the ball . <i>Bulletin of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/blms.12062\">https://doi.org/10.1112/blms.12062</a>","short":"A. Akopyan, R. Karasev, Bulletin of the London Mathematical Society 49 (2017) 690–693.","chicago":"Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” <i>Bulletin of the London Mathematical Society</i>. Wiley, 2017. <a href=\"https://doi.org/10.1112/blms.12062\">https://doi.org/10.1112/blms.12062</a>.","mla":"Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” <i>Bulletin of the London Mathematical Society</i>, vol. 49, no. 4, Wiley, 2017, pp. 690–93, doi:<a href=\"https://doi.org/10.1112/blms.12062\">10.1112/blms.12062</a>.","ama":"Akopyan A, Karasev R. A tight estimate for the waist of the ball . <i>Bulletin of the London Mathematical Society</i>. 2017;49(4):690-693. doi:<a href=\"https://doi.org/10.1112/blms.12062\">10.1112/blms.12062</a>"},"date_published":"2017-08-01T00:00:00Z","oa":1,"scopus_import":"1","_id":"707","doi":"10.1112/blms.12062","author":[{"orcid":"0000-0002-2548-617X","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"date_created":"2018-12-11T11:48:02Z","oa_version":"Preprint","title":"A tight estimate for the waist of the ball ","publication_status":"published","abstract":[{"lang":"eng","text":"We answer a question of M. Gromov on the waist of the unit ball."}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1608.06279","open_access":"1"}],"page":"690 - 693"},{"abstract":[{"text":"The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's.","lang":"eng"}],"publication_status":"published","title":"Discrete Morse theory for random complexes ","oa_version":"Published Version","page":"86","file_date_updated":"2020-07-14T12:47:26Z","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"author":[{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","orcid":"0000-0002-0659-3201","last_name":"Nikitenko"}],"doi":"10.15479/AT:ISTA:th_873","date_created":"2019-04-09T15:04:32Z","OA_place":"publisher","_id":"6287","supervisor":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"citation":{"apa":"Nikitenko, A. (2017). <i>Discrete Morse theory for random complexes </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>","mla":"Nikitenko, Anton. <i>Discrete Morse Theory for Random Complexes </i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>.","chicago":"Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>.","short":"A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017.","ama":"Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>","ieee":"A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017.","ista":"Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria."},"oa":1,"date_published":"2017-10-27T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"87","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"5678"},{"relation":"part_of_dissertation","id":"718","status":"public"}]},"file":[{"file_size":2324870,"date_updated":"2020-07-14T12:47:26Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_id":"6289","date_created":"2019-04-09T14:54:51Z","file_name":"2017_Thesis_Nikitenko.pdf","checksum":"ece7e598a2f060b263c2febf7f3fe7f9","relation":"main_file"},{"relation":"source_file","file_name":"2017_Thesis_Nikitenko_source.zip","file_id":"6290","checksum":"99b7ad76e317efd447af60f91e29b49b","date_created":"2019-04-09T14:54:51Z","access_level":"closed","creator":"dernst","date_updated":"2020-07-14T12:47:26Z","file_size":2863219,"content_type":"application/zip"}],"ddc":["514","516","519"],"date_updated":"2026-04-08T14:19:31Z","status":"public","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"HeEd"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"pubrep_id":"873","type":"dissertation","year":"2017","publisher":"Institute of Science and Technology Austria","month":"10","corr_author":"1","degree_awarded":"PhD","day":"27"},{"external_id":{"arxiv":["1607.05915"],"isi":["000416417500004"]},"status":"public","article_processing_charge":"No","department":[{"_id":"HeEd"}],"isi":1,"publication":"Advances in Applied Probability","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"6287","relation":"dissertation_contains"}]},"date_updated":"2026-04-08T14:19:30Z","publisher":"Cambridge University Press","month":"09","day":"01","publist_id":"6962","issue":"3","ec_funded":1,"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"type":"journal_article","year":"2017","page":"745 - 767","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.05915"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4."}],"publication_status":"published","title":"Expected sizes of poisson Delaunay mosaics and their discrete Morse functions","oa_version":"Preprint","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Nikitenko","orcid":"0000-0002-0659-3201"},{"first_name":"Matthias","last_name":"Reitzner","full_name":"Reitzner, Matthias"}],"date_created":"2018-12-11T11:48:07Z","doi":"10.1017/apr.2017.20","scopus_import":"1","_id":"718","arxiv":1,"citation":{"mla":"Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” <i>Advances in Applied Probability</i>, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:<a href=\"https://doi.org/10.1017/apr.2017.20\">10.1017/apr.2017.20</a>.","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” <i>Advances in Applied Probability</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/apr.2017.20\">https://doi.org/10.1017/apr.2017.20</a>.","short":"H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767.","ama":"Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. <i>Advances in Applied Probability</i>. 2017;49(3):745-767. doi:<a href=\"https://doi.org/10.1017/apr.2017.20\">10.1017/apr.2017.20</a>","apa":"Edelsbrunner, H., Nikitenko, A., &#38; Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. <i>Advances in Applied Probability</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/apr.2017.20\">https://doi.org/10.1017/apr.2017.20</a>","ista":"Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.","ieee":"H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson Delaunay mosaics and their discrete Morse functions,” <i>Advances in Applied Probability</i>, vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017."},"oa":1,"date_published":"2017-09-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        49","publication_identifier":{"issn":["0001-8678"]},"volume":49}]