Georg F Osang
Edelsbrunner Group
13 Publications
2023 | Published | Journal Article | IST-REx-ID: 12086 |

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
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Published | Journal Article | IST-REx-ID: 12709 |

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
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Published | Thesis | IST-REx-ID: 9056 |

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
[Published Version]
View
| Files available
| DOI
2021 | Published | Journal Article | IST-REx-ID: 10204 |

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
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Published | Conference Paper | IST-REx-ID: 10367 |

Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler, C., … 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
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Published | Journal Article | IST-REx-ID: 9465 |

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
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 9605 |

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
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9317 |

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
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8703 |

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
[Published Version]
View
| Files available
| DOI
2019 | Published | Conference Paper | IST-REx-ID: 7216
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
View
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 187 |

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
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 193 |

Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … 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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1065 |

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
[Submitted Version]
View
| Files available
| DOI
| WoS
Grants
13 Publications
2023 | Published | Journal Article | IST-REx-ID: 12086 |

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
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Published | Journal Article | IST-REx-ID: 12709 |

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
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Published | Thesis | IST-REx-ID: 9056 |

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
[Published Version]
View
| Files available
| DOI
2021 | Published | Journal Article | IST-REx-ID: 10204 |

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
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Published | Conference Paper | IST-REx-ID: 10367 |

Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler, C., … 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
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Published | Journal Article | IST-REx-ID: 9465 |

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
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 9605 |

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
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9317 |

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
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8703 |

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
[Published Version]
View
| Files available
| DOI
2019 | Published | Conference Paper | IST-REx-ID: 7216
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
View
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 187 |

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
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 193 |

Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … 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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1065 |

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
[Submitted Version]
View
| Files available
| DOI
| WoS