Georg F Osang
Edelsbrunner Group
13 Publications
2023 | Journal Article | IST-REx-ID: 12086 | 
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.
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 12709 |
Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-022-00476-8.
View
| Files available
| DOI
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10367 |
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.
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Journal Article | IST-REx-ID: 9465 |
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.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9605 |
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.
View
| Files available
| DOI
| arXiv
2021 | Journal Article | IST-REx-ID: 9317 |
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.
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 10204
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.
View
| DOI
| WoS
| PubMed | Europe PMC
2021 | Thesis | IST-REx-ID: 9056 |
Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.
View
| Files available
| DOI
2020 | Conference Paper | IST-REx-ID: 8703 |
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.
View
| Files available
| DOI
2019 | 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
2018 | Conference Paper | IST-REx-ID: 187 |
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.
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 193 |
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.
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Journal Article | IST-REx-ID: 1065 |
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.
View
| Files available
| DOI
| WoS
13 Publications
2023 | Journal Article | IST-REx-ID: 12086 |
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.
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 12709 |
Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-022-00476-8.
View
| Files available
| DOI
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10367 |
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.
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Journal Article | IST-REx-ID: 9465 |
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.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9605 |
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.
View
| Files available
| DOI
| arXiv
2021 | Journal Article | IST-REx-ID: 9317 |
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.
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 10204
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.
View
| DOI
| WoS
| PubMed | Europe PMC
2021 | Thesis | IST-REx-ID: 9056 |
Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.
View
| Files available
| DOI
2020 | Conference Paper | IST-REx-ID: 8703 |
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.
View
| Files available
| DOI
2019 | 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
2018 | Conference Paper | IST-REx-ID: 187 |
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.
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 193 |
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.
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Journal Article | IST-REx-ID: 1065 |
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.
View
| Files available
| DOI
| WoS