Georg Osang

Orcid: 0000-0002-8882-5116

Affiliations:
  • IDEMS International, Reading, UK
  • Institute of Science and Technology (IST) Austria, Klosterneuburg, Austria (PhD)
  • Karlsruhe Institute of Technology, Germany


According to our database1, Georg Osang authored at least 11 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Psymple: A Python package for complex systems modelling.
J. Open Source Softw., May, 2025

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

2022
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., December, 2022

2021
Computing the Multicover Bifiltration.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Generalizing CGAL Periodic Delaunay Triangulations.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale.
Proceedings of the 2019 IEEE Intelligent Transportation Systems Conference, 2019

2018
The Multi-cover Persistence of Euclidean Balls.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Pushdown reachability with constant treewidth.
Inf. Process. Lett., 2017

2013
Unavoidable subtrees.
Discret. Math., 2013

Fork-forests in bi-colored complete bipartite graphs.
Discret. Appl. Math., 2013


  Loading...