Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




263 Publications

2018 | Journal Article | IST-REx-ID: 58 | OA
Akopyan, A., & Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M110407X
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 458 | OA
Akopyan, A., & Bobenko, A. (2018). Incircular nets and confocal conics. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7292
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 106 | OA
Akopyan, A., & Petrunin, A. (2018). Long geodesics on convex surfaces. Mathematical Intelligencer. Springer. https://doi.org/10.1007/s00283-018-9795-5
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 530 | OA
Edelsbrunner, H., & Iglesias Ham, M. (2018). Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.06.014
[Preprint] View | Files available | DOI | WoS
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … 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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 312 | OA
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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 409 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 87 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 6355 | OA
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
[Published Version] View | Files available | DOI | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 1064 | OA
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
[Published Version] View | Files available | DOI | WoS
 
2018 | Preprint | IST-REx-ID: 75 | OA
Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 481 | OA
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
[Published Version] View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 521 | OA
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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Journal Article | IST-REx-ID: 568 | OA
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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Book Chapter | IST-REx-ID: 5803
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
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 688 | OA
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
[Published Version] View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 707 | OA
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
[Preprint] View | DOI | Download Preprint (ext.)
 
2017 | Journal Article | IST-REx-ID: 718 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Thesis | IST-REx-ID: 6287 | OA
Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873
[Published Version] View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1433 | OA
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
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

Search

Filter Publications