Edelsbrunner, H., &; Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature.https://doi.org/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, R., Kerber, M., Lesnick, M., &; Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature.https://doi.org/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, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanid, B., Bregler, C.,https://doi.org/10.18653/v1/2021.acl-tutorials.6__Imbrasaite, V. (2021). Recognizing multimodal entailment. In 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts (pp. 29–30). Bangkok, Thailand: Association for Computational Linguistics.https://doi.org/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, H., Nikitenko, A., &; Osang, G. F. (2021). A step in the Delaunay mosaic of order k. Journal of Geometry. Springer Nature.https://doi.org/10.1007/s00022-021-00577-4 
LibreCat: https://research-explorer.ista.ac.at/record/9465
DOI: 10.1007/s00022-021-00577-4

Edelsbrunner, H., &; Osang, G. F. (2021). The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. Springer Nature.https://doi.org/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, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg.https://doi.org/10.15479/AT:ISTA:9056 
LibreCat: https://research-explorer.ista.ac.at/record/9056
DOI: 10.15479/AT:ISTA:9056

Osang, G. F., Edelsbrunner, H., &; Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. Royal Society of Chemistry .https://doi.org/10.1039/d1sm00774b 
LibreCat: https://research-explorer.ista.ac.at/record/10204
DOI: 10.1039/d1sm00774b
WoS: 000700090000001
PMID: 34569592

Corbet, R., Kerber, M., Lesnick, M., &; Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, G. F., Rouxel-Labbé, M., &; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2020.75 
LibreCat: https://research-explorer.ista.ac.at/record/8703
DOI: 10.4230/LIPIcs.ESA.2020.75

Osang, G. F., Cook, J., Fabrikant, A., &; Gruteser, M. (2019). LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In 2019 IEEE Intelligent Transportation Systems Conference. Auckland, New Zealand: IEEE.https://doi.org/10.1109/ITSC.2019.8917514 
LibreCat: https://research-explorer.ista.ac.at/record/7216
DOI: 10.1109/ITSC.2019.8917514
WoS: 000521238102050

Edelsbrunner, H., &; Osang, G. F. (2018). The multi-cover persistence of Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.34 
LibreCat: https://research-explorer.ista.ac.at/record/187
DOI: 10.4230/LIPIcs.SoCG.2018.34

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

Chatterjee, K., &; Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2017.02.003 
LibreCat: https://research-explorer.ista.ac.at/record/1065
DOI: 10.1016/j.ipl.2017.02.003
WoS: 000399506600005