default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWanbin Son
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Sang Duk Yoon, Min-Gyu Kim
, Wanbin Son, Hee-Kap Ahn:
Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. 715: 60-70 (2018)- 2017
- [j6]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123: 27-35 (2017) - 2016
- [c9]Eunjin Oh, Wanbin Son, Hee-Kap Ahn:
Constrained Geodesic Centers of a Simple Polygon. SWAT 2016: 29:1-29:13 - 2015
- [j5]Wanbin Son, Sang Won Bae, Hee-Kap Ahn:
Group nearest-neighbor queries in the L1 plane. Theor. Comput. Sci. 592: 39-48 (2015) - [c8]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn:
Geometric Matching Algorithms for Two Realistic Terrains. ISAAC 2015: 285-295 - [c7]Wanbin Son, Peyman Afshani:
Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. TAMC 2015: 189-199 - 2014
- [j4]Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k Centers over Streaming Data for Small k. Int. J. Comput. Geom. Appl. 24(2): 107-124 (2014) - [j3]Wanbin Son, Seung-won Hwang, Hee-Kap Ahn:
MSSQ: Manhattan Spatial Skyline Queries. Inf. Syst. 40: 67-83 (2014) - [c6]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan Spatial Skyline Queries. WALCOM 2014: 22-33 - 2013
- [c5]Hee-Kap Ahn, Sang Won Bae, Wanbin Son:
Group Nearest Neighbor Queries in the L 1 Plane. TAMC 2013: 52-61 - 2012
- [c4]Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k-center over Streaming Data for Small k. ISAAC 2012: 54-63 - 2011
- [j2]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering points by disjoint boxes with outliers. Comput. Geom. 44(3): 178-190 (2011) - [j1]Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn, Seung-won Hwang:
Spatial skyline queries: exact and approximation algorithms. GeoInformatica 15(4): 665-697 (2011) - [c3]Wanbin Son, Seung-won Hwang, Hee-Kap Ahn:
MSSQ: Manhattan Spatial Skyline Queries. SSTD 2011: 313-329
2000 – 2009
- 2009
- [c2]Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Square and Rectangle Covering with Outliers. FAW 2009: 132-140 - [c1]Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang:
Spatial Skyline Queries: An Efficient Geometric Algorithm. SSTD 2009: 247-264 - [i2]Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang:
Spatial Skyline Queries: An Efficient Geometric Algorithm. CoRR abs/0903.3072 (2009) - [i1]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering Points by Disjoint Boxes with Outliers. CoRR abs/0910.1643 (2009)
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:29 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:
