default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérôme Urhausen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Jérôme Urhausen:
On Geometric Measures and Their Computation. Utrecht University, Netherlands, 2023- [j5]Kevin Buchin
, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom. 109: 101923 (2023) - 2022
- [j4]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. Comput. Geom. Topol. 1(1): 2:1-2:21 (2022) - [j3]Tianfeng Feng, Leonie Ryvkin, Jérôme Urhausen, Giovanni Viglietta:
Complexity of Critter Crunch. IEICE Trans. Inf. Syst. 105-D(3): 517-531 (2022) - 2021
- [j2]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. J. Comput. Geom. 13(2): 115-150 (2021) - [c11]Maarten Löffler, Jérôme Urhausen:
Mapping Points to the Grid with Bounded Hausdor Distance. CCCG 2021: 47-55 - [c10]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG 2021: 5:1-5:19 - [c9]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. MFCS 2021: 56:1-56:19 - [c8]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. WADS 2021: 243-257 - [c7]Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen:
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. WADS 2021: 627-640 - [c6]Marc J. van Kreveld, Bettina Speckmann, Jérôme Urhausen:
Diverse Partitions of Colored Points. WADS 2021: 641-654 - [i7]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR abs/2103.09811 (2021) - [i6]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. CoRR abs/2105.09047 (2021) - [i5]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. CoRR abs/2105.09922 (2021) - 2020
- [j1]Ivor van der Hoog, Vahideh Keikha, Maarten Löffler, Ali Mohades, Jérôme Urhausen:
Maximum-area triangle in a convex polygon, revisited. Inf. Process. Lett. 161: 105943 (2020) - [c5]Casper van Dommelen, Marc J. van Kreveld, Jérôme Urhausen:
The Spiroplot App (Media Exposition). SoCG 2020: 71:1-71:5
2010 – 2019
- 2019
- [c4]Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen:
The k-Fréchet Distance: How to Walk Your Dog While Teleporting. ISAAC 2019: 50:1-50:15 - [i4]Hugo A. Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen:
The k-Fréchet distance. CoRR abs/1903.02353 (2019) - 2018
- [c3]Tamara Mchedlidze, Jérôme Urhausen:
\beta -Stars or On Extending a Drawing of a Connected Subgraph. GD 2018: 416-429 - [c2]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex Partial Transversals of Planar Regions. ISAAC 2018: 52:1-52:12 - [i3]Tamara Mchedlidze, Jérôme Urhausen:
β-Stars or On Extending a Drawing of a Connected Subgraph. CoRR abs/1808.10366 (2018) - [i2]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex partial transversals of planar regions. CoRR abs/1809.10078 (2018) - 2017
- [i1]Vahideh Keikha, Maarten Löffler, Jérôme Urhausen, Ivor van der Hoog:
Maximum-Area Triangle in a Convex Polygon, Revisited. CoRR abs/1705.11035 (2017) - 2014
- [c1]Emanuel Jöbstl, Jérôme Urhausen, Elisaweta Masserova, Ainara Askar:
sGrid: Centralized management of BOINC-based research projects - Summary. GI-Jahrestagung 2014: 2487
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-12-26 00:47 CET 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:
