default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaehoon Ahn 0001
Person information
- affiliation: Pohang University of Science and Technology, Pohang, Republic of Korea
Other persons with the same name
- Taehoon Ahn 0002 — Korea Advanced Institute of Science and Technology, Daejeon, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Taehoon Ahn
, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon:
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) 2024: 303-317- [i2]Taehoon Ahn, Sang Won Bae:
Constrained Two-Line Center Problems. CoRR abs/2409.13304 (2024) - 2023
- [j3]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Algorithmica 85(8): 2214-2237 (2023) - [c5]Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn:
Parallel Line Centers with Guaranteed Separation. CCCG 2023: 153-159 - 2022
- [j2]Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
Rearranging a sequence of points onto a line. Comput. Geom. 107: 101887 (2022) - [c4]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. SoCG 2022: 51:1-51:15 - [i1]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-point Voronoi diagrams in the presence of rectangular obstacles. CoRR abs/2203.03198 (2022) - 2021
- [c3]Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
Rearranging a Sequence of Points onto a Line. CCCG 2021: 36-46
2010 – 2019
- 2019
- [j1]Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145: 16-23 (2019) - 2018
- [c2]Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM 2018: 44-55 - [c1]Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. WALCOM 2018: 56-67
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-10-18 20:30 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:
