Georg F Osang

Edelsbrunner Group

13 Publications

Mark all

[13]
2023 | Journal Article | IST-REx-ID: 12086 | OA
Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6
[Published Version] View | Files available | DOI | WoS
 
[12]
2023 | Journal Article | IST-REx-ID: 12709 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8
[Published Version] View | Files available | DOI | WoS | arXiv
 
[11]
2021 | Conference Paper | IST-REx-ID: 10367 | OA
Ilharco C, Shirazi A, Gopalan A, et al. 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. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[10]
2021 | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. Journal of Geometry. 2021;112(1). doi:10.1007/s00022-021-00577-4
[Published Version] View | Files available | DOI
 
[9]
2021 | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 2021;65:1296–1313. doi:10.1007/s00454-021-00281-9
[Published Version] View | Files available | DOI | WoS
 
[8]
2021 | Thesis | IST-REx-ID: 9056 | OA
Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056
[Published Version] View | Files available | DOI
 
[7]
2021 | Journal Article | IST-REx-ID: 10204 | OA
Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115. doi:10.1039/d1sm00774b
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Conference Paper | IST-REx-ID: 9605 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27
[Published Version] View | Files available | DOI | arXiv
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75
[Published Version] View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In: 2019 IEEE Intelligent Transportation Systems Conference. IEEE; 2019. doi:10.1109/ITSC.2019.8917514
View | DOI | WoS
 
[3]
2018 | Conference Paper | IST-REx-ID: 187 | OA
Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34
[Published Version] View | Files available | DOI
 
[2]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
[Submitted Version] View | Files available | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed

13 Publications

Mark all

[13]
2023 | Journal Article | IST-REx-ID: 12086 | OA
Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6
[Published Version] View | Files available | DOI | WoS
 
[12]
2023 | Journal Article | IST-REx-ID: 12709 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8
[Published Version] View | Files available | DOI | WoS | arXiv
 
[11]
2021 | Conference Paper | IST-REx-ID: 10367 | OA
Ilharco C, Shirazi A, Gopalan A, et al. 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. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[10]
2021 | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. Journal of Geometry. 2021;112(1). doi:10.1007/s00022-021-00577-4
[Published Version] View | Files available | DOI
 
[9]
2021 | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 2021;65:1296–1313. doi:10.1007/s00454-021-00281-9
[Published Version] View | Files available | DOI | WoS
 
[8]
2021 | Thesis | IST-REx-ID: 9056 | OA
Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056
[Published Version] View | Files available | DOI
 
[7]
2021 | Journal Article | IST-REx-ID: 10204 | OA
Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115. doi:10.1039/d1sm00774b
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Conference Paper | IST-REx-ID: 9605 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27
[Published Version] View | Files available | DOI | arXiv
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75
[Published Version] View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In: 2019 IEEE Intelligent Transportation Systems Conference. IEEE; 2019. doi:10.1109/ITSC.2019.8917514
View | DOI | WoS
 
[3]
2018 | Conference Paper | IST-REx-ID: 187 | OA
Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34
[Published Version] View | Files available | DOI
 
[2]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
[Submitted Version] View | Files available | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed