Georg F Osang

Edelsbrunner Group

13 Publications

Mark all

[13]
2023 | Journal Article | IST-REx-ID: 12086 | OA
H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.
[Published Version] View | Files available | DOI | WoS
 
[12]
2023 | Journal Article | IST-REx-ID: 12709 | OA
R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[11]
2021 | Conference Paper | IST-REx-ID: 10367 | OA
C. Ilharco 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, Bangkok, Thailand, 2021, pp. 29–30.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[10]
2021 | Journal Article | IST-REx-ID: 9465 | OA
H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” Journal of Geometry, vol. 112, no. 1. Springer Nature, 2021.
[Published Version] View | Files available | DOI
 
[9]
2021 | Journal Article | IST-REx-ID: 9317 | OA
H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1296–1313, 2021.
[Published Version] View | Files available | DOI | WoS
 
[8]
2021 | Thesis | IST-REx-ID: 9056 | OA
G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.
[Published Version] View | Files available | DOI
 
[7]
2021 | Journal Article | IST-REx-ID: 10204 | OA
G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” Soft Matter, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Conference Paper | IST-REx-ID: 9605 | OA
R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.
[Published Version] View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale,” in 2019 IEEE Intelligent Transportation Systems Conference, Auckland, New Zealand, 2019.
View | DOI | WoS
 
[3]
2018 | Conference Paper | IST-REx-ID: 187 | OA
H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
[Published Version] View | Files available | DOI
 
[2]
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen 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, Incheon, Republic of Korea, 2018, pp. 51–65.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
[Submitted Version] View | Files available | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed

13 Publications

Mark all

[13]
2023 | Journal Article | IST-REx-ID: 12086 | OA
H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.
[Published Version] View | Files available | DOI | WoS
 
[12]
2023 | Journal Article | IST-REx-ID: 12709 | OA
R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[11]
2021 | Conference Paper | IST-REx-ID: 10367 | OA
C. Ilharco 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, Bangkok, Thailand, 2021, pp. 29–30.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[10]
2021 | Journal Article | IST-REx-ID: 9465 | OA
H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” Journal of Geometry, vol. 112, no. 1. Springer Nature, 2021.
[Published Version] View | Files available | DOI
 
[9]
2021 | Journal Article | IST-REx-ID: 9317 | OA
H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1296–1313, 2021.
[Published Version] View | Files available | DOI | WoS
 
[8]
2021 | Thesis | IST-REx-ID: 9056 | OA
G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.
[Published Version] View | Files available | DOI
 
[7]
2021 | Journal Article | IST-REx-ID: 10204 | OA
G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” Soft Matter, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Conference Paper | IST-REx-ID: 9605 | OA
R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.
[Published Version] View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale,” in 2019 IEEE Intelligent Transportation Systems Conference, Auckland, New Zealand, 2019.
View | DOI | WoS
 
[3]
2018 | Conference Paper | IST-REx-ID: 187 | OA
H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
[Published Version] View | Files available | DOI
 
[2]
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen 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, Incheon, Republic of Korea, 2018, pp. 51–65.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
[Submitted Version] View | Files available | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed