Georg Osang

According to our database, Georg Osang authored at least 10 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Computing the Multicover Bifiltration.

René Corbet, Michael Kerber, Michael Lesnick, Georg Osang

Discret. Comput. Geom., September, 2023

A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.

Herbert Edelsbrunner, Georg Osang

Algorithmica, 2023

2022

Evaluating Engagement and Learning Based on a Student Categorization using STACK, Exam Data, Key Informant Interviews, and Focus Group Discussions.

Zevick Otieno Juma, Mildred Atieno Ayere, Michael Obiero Oyengo, Georg Osang

Int. J. Emerg. Technol. Learn., December, 2022

2021

The Multi-Cover Persistence of Euclidean Balls.

Herbert Edelsbrunner, Georg Osang

Discret. Comput. Geom., 2021

2020

Generalizing CGAL Periodic Delaunay Triangulations.

Georg Osang, Mael Rouxel-Labbé, Monique Teillaud

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale.

Georg Osang, James Cook, Alex Fabrikant, Marco Gruteser

Proceedings of the 2019 IEEE Intelligent Transportation Systems Conference, 2019

2017

Pushdown reachability with constant treewidth.

Krishnendu Chatterjee, Georg Osang

Inf. Process. Lett., 2017

2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.

Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár

IACR Cryptol. ePrint Arch., 2016

2013

Unavoidable subtrees.

Maria Axenovich, Georg Osang

Discret. Math., 2013

Fork-forests in bi-colored complete bipartite graphs.

Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter

Discret. Appl. Math., 2013