Georg F Osang

Edelsbrunner Group

13 Publications

Mark all

[13]
2023 | Published | Journal Article | IST-REx-ID: 12709 | OA
Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[12]
2023 | Published | Journal Article | IST-REx-ID: 12086 | OA
Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
[Published Version] View | Files available | DOI | WoS
 
[11]
2021 | Published | Thesis | IST-REx-ID: 9056 | OA
Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.
[Published Version] View | Files available | DOI
 
[10]
2021 | Published | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner, Herbert, and Georg F. Osang. “The Multi-Cover Persistence of Euclidean Balls.” Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1296–1313, doi:10.1007/s00454-021-00281-9.
[Published Version] View | Files available | DOI | WoS
 
[9]
2021 | Published | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” Journal of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.
[Published Version] View | Files available | DOI
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 9605 | OA
Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2021 | Published | Journal Article | IST-REx-ID: 10204 | OA
Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10367 | OA
Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” 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.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Published | Conference Paper | IST-REx-ID: 8703 | OA
Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
[Published Version] View | Files available | DOI
 
[4]
2019 | Published | Conference Paper | IST-REx-ID: 7216
Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” 2019 IEEE Intelligent Transportation Systems Conference, 8917514, IEEE, 2019, doi:10.1109/ITSC.2019.8917514.
View | DOI | WoS
 
[3]
2018 | Published | Conference Paper | IST-REx-ID: 187 | OA
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.
[Published Version] View | Files available | DOI
 
[2]
2018 | Published | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Published | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp. 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

Export / Embed

Grants


13 Publications

Mark all

[13]
2023 | Published | Journal Article | IST-REx-ID: 12709 | OA
Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[12]
2023 | Published | Journal Article | IST-REx-ID: 12086 | OA
Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
[Published Version] View | Files available | DOI | WoS
 
[11]
2021 | Published | Thesis | IST-REx-ID: 9056 | OA
Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.
[Published Version] View | Files available | DOI
 
[10]
2021 | Published | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner, Herbert, and Georg F. Osang. “The Multi-Cover Persistence of Euclidean Balls.” Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1296–1313, doi:10.1007/s00454-021-00281-9.
[Published Version] View | Files available | DOI | WoS
 
[9]
2021 | Published | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” Journal of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.
[Published Version] View | Files available | DOI
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 9605 | OA
Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2021 | Published | Journal Article | IST-REx-ID: 10204 | OA
Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10367 | OA
Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” 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.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Published | Conference Paper | IST-REx-ID: 8703 | OA
Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
[Published Version] View | Files available | DOI
 
[4]
2019 | Published | Conference Paper | IST-REx-ID: 7216
Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” 2019 IEEE Intelligent Transportation Systems Conference, 8917514, IEEE, 2019, doi:10.1109/ITSC.2019.8917514.
View | DOI | WoS
 
[3]
2018 | Published | Conference Paper | IST-REx-ID: 187 | OA
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.
[Published Version] View | Files available | DOI
 
[2]
2018 | Published | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[1]
2017 | Published | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp. 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

Export / Embed