default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabian Stehn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Fabian Stehn:
Geometric hybrid registration. Free University of Berlin, 2010, pp. 1-134
Journal Articles
- 2019
- [j6]Hee-Kap Ahn
, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j5]Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30(2): 293-313 (2019) - 2018
- [j4]Christian Knauer, Luise Sommer, Fabian Stehn:
Elastic geometric shape matching for translations under the Manhattan norm. Comput. Geom. 73: 57-69 (2018) - [j3]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - 2017
- [j2]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123: 27-35 (2017) - 2011
- [j1]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. Theor. Comput. Sci. 412(4-5): 375-382 (2011)
Conference and Workshop Papers
- 2018
- [c12]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. SoCG 2018: 6:1-6:13 - [c11]Christian Knauer, Luise Sommer, Fabian Stehn:
An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods. ICCSA (2) 2018: 425-443 - [c10]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - 2017
- [c9]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - 2015
- [c8]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) 2015: 678-688 - [c7]Christian Knauer, Fabian Stehn:
Elastic Geometric Shape Matching for Point Sets under Translations. WADS 2015: 578-592 - 2014
- [c6]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan Spatial Skyline Queries. WALCOM 2014: 22-33 - 2011
- [c5]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Non-uniform Geometric Matchings. ICCSA (3) 2011: 44-57 - 2009
- [c4]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. FAW 2009: 108-119 - [c3]Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn:
Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112 - 2008
- [c2]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) 2008: 188-195 - 2007
- [c1]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW 2007: 26-37
Informal and Other Publications
- 2019
- [i3]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - 2017
- [i2]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - 2016
- [i1]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR abs/1607.05547 (2016)
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-06-04 21:28 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:
