Georg Osang

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 13

Top Topics

Delaunay Triangulation

Computing Power

Group Discussion

Top Venues

Discret. Comput. Geom.

Publications

René Corbet, Michael Kerber, Michael Lesnick, Georg Osang
Computing the Multicover Bifiltration. Discret. Comput. Geom. 70 (2) (2023)
Herbert Edelsbrunner, Georg Osang
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Algorithmica 85 (1) (2023)
Zevick Otieno Juma, Mildred Atieno Ayere, Michael Obiero Oyengo, Georg Osang
Evaluating Engagement and Learning Based on a Student Categorization using STACK, Exam Data, Key Informant Interviews, and Focus Group Discussions. Int. J. Emerg. Technol. Learn. 17 (23) (2022)
Herbert Edelsbrunner, Georg Osang
The Multi-Cover Persistence of Euclidean Balls. Discret. Comput. Geom. 65 (4) (2021)
René Corbet, Michael Kerber, Michael Lesnick, Georg Osang
Computing the Multicover Bifiltration. SoCG (2021)
René Corbet, Michael Kerber, Michael Lesnick, Georg Osang
Computing the Multicover Bifiltration. CoRR (2021)
Herbert Edelsbrunner, Georg Osang
A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes. CoRR (2020)
Georg Osang, Mael Rouxel-Labbé, Monique Teillaud
Generalizing CGAL Periodic Delaunay Triangulations. ESA (2020)
Georg Osang, James Cook, Alex Fabrikant, Marco Gruteser
LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. ITSC (2019)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolinek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS (2018)
Herbert Edelsbrunner, Georg Osang
The Multi-cover Persistence of Euclidean Balls. SoCG (2018)
Krishnendu Chatterjee, Georg Osang
Pushdown reachability with constant treewidth. Inf. Process. Lett. 122 (2017)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Maria Axenovich, Georg Osang
Unavoidable subtrees. Discret. Math. 313 (8) (2013)
Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161 (10-11) (2013)
Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
Fork-forests in bi-colored complete bipartite graphs CoRR (2012)