default search action
Georg Osang
Person information
- affiliation: IDEMS International, Reading, UK
- affiliation (PhD): Institute of Science and Technology (IST) Austria, Klosterneuburg, Austria
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Herbert Edelsbrunner
, Georg Osang
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Algorithmica 85(1): 277-295 (2023) - [j6]René Corbet
Computing the Multicover Bifiltration. Discret. Comput. Geom. 70(2): 376-405 (2023) - 2022
- [j5]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): 103-114 (2022) - 2021
- [j4]Herbert Edelsbrunner
The Multi-Cover Persistence of Euclidean Balls. Discret. Comput. Geom. 65(4): 1296-1313 (2021) - [c5]René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. SoCG 2021: 27:1-27:17 - [i4]René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. CoRR abs/2103.07823 (2021) - 2020
- [c4]Georg Osang
Generalizing CGAL Periodic Delaunay Triangulations. ESA 2020: 75:1-75:17 - [i3]Herbert Edelsbrunner, Georg Osang:
A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes. CoRR abs/2011.03617 (2020)
2010 – 2019
- 2019
- [c3]Georg Osang, James Cook, Alex Fabrikant, Marco Gruteser:
LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. ITSC 2019: 2244-2251 - 2018
- [c2]Joël Alwen, Peter Gazi, Chethan Kamath
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS 2018: 51-65 - [c1]Herbert Edelsbrunner, Georg Osang:
The Multi-cover Persistence of Euclidean Balls. SoCG 2018: 34:1-34:14 - 2017
- [j3]Krishnendu Chatterjee
Pushdown reachability with constant treewidth. Inf. Process. Lett. 122: 25-29 (2017) - 2016
- [i2]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: 783 (2016) - 2013
- [j2]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161(10-11): 1363-1366 (2013) - [j1]Maria Axenovich, Georg Osang:
Unavoidable subtrees. Discret. Math. 313(8): 924-930 (2013) - 2012
- [i1]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. CoRR abs/1201.2551 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: