Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.”10.1007/s00453-022-01027-6__Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
LibreCat: https://research-explorer.ista.ac.at/record/12086
DOI: 10.1007/s00453-022-01027-6
WoS: 000846967100001

Corbet, René, et al. “Computing the Multicover Bifiltration.”10.1007/s00454-022-00476-8__Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8.
LibreCat: https://research-explorer.ista.ac.at/record/12709
DOI: 10.1007/s00454-022-00476-8
WoS: 000936496800001
arXiv: 2103.07823

Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.”10.18653/v1/2021.acl-tutorials.6__59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts, Association for Computational Linguistics, 2021, pp. 29–30, doi:10.18653/v1/2021.acl-tutorials.6.
LibreCat: https://research-explorer.ista.ac.at/record/10367
DOI: 10.18653/v1/2021.acl-tutorials.6

Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.”10.1007/s00022-021-00577-4__Journal of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.
LibreCat: https://research-explorer.ista.ac.at/record/9465
DOI: 10.1007/s00022-021-00577-4

Edelsbrunner, Herbert, and Georg F. Osang. “The Multi-Cover Persistence of Euclidean Balls.”10.1007/s00454-021-00281-9__Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1296–1313, doi:10.1007/s00454-021-00281-9.
LibreCat: https://research-explorer.ista.ac.at/record/9317
DOI: 10.1007/s00454-021-00281-9
WoS: 000635460400001

Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.
LibreCat: https://research-explorer.ista.ac.at/record/9056
DOI: 10.15479/AT:ISTA:9056

Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.”10.1039/d1sm00774b__Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.
LibreCat: https://research-explorer.ista.ac.at/record/10204
DOI: 10.1039/d1sm00774b
WoS: 000700090000001
PMID: 34569592

Corbet, René, et al. “Computing the Multicover Bifiltration.”10.4230/LIPIcs.SoCG.2021.27__Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
LibreCat: https://research-explorer.ista.ac.at/record/9605
DOI: 10.4230/LIPIcs.SoCG.2021.27
arXiv: 2103.07823

Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.”10.4230/LIPIcs.ESA.2020.75__28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
LibreCat: https://research-explorer.ista.ac.at/record/8703
DOI: 10.4230/LIPIcs.ESA.2020.75

Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.”10.1109/ITSC.2019.8917514__2019 IEEE Intelligent Transportation Systems Conference, 8917514, IEEE, 2019, doi:10.1109/ITSC.2019.8917514.
LibreCat: https://research-explorer.ista.ac.at/record/7216
DOI: 10.1109/ITSC.2019.8917514
WoS: 000521238102050

Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.34.
LibreCat: https://research-explorer.ista.ac.at/record/187
DOI: 10.4230/LIPIcs.SoCG.2018.34

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.
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

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.
LibreCat: https://research-explorer.ista.ac.at/record/1065
DOI: 10.1016/j.ipl.2017.02.003
WoS: 000399506600005