default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHyeon-Suk Na
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j18]Peter Brass
, Hyeon-Suk Na, Chan-Su Shin:
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. Theor. Comput. Sci. 607: 96-112 (2015)- [c17]Taeyeong Choi, Hyeon-Suk Na:
Stealthy behavior simulations based on cognitive data. ICMLC 2015: 68-74 - 2014
- [c16]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. AAIM 2014: 1-12 - 2013
- [i4]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. CoRR abs/1311.3149 (2013) - 2011
- [j17]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - [j16]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21(2): 157-178 (2011) - [c15]Peter Brass, Hyeon-Suk Na:
Sensor redundancy check without geometric information. RACS 2011: 183-186 - 2010
- [j15]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010) - [j14]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geom. Appl. 20(3): 327-339 (2010) - [j13]Peter Brass, Hyeon-Suk Na:
Finding the maximum bounded intersection of k out of n halfplanes. Inf. Process. Lett. 110(3): 113-115 (2010) - [j12]Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Querying Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 39(5): 1888-1918 (2010) - [i3]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010)
2000 – 2009
- 2009
- [j11]Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009) - [j10]Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. 42(3): 207-213 (2009) - [j9]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [i2]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Computing k-Centers On a Line. CoRR abs/0902.3282 (2009) - 2008
- [j8]Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 38(3): 802-824 (2008) - [c14]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679 - 2007
- [j7]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) - [c13]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c12]Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Querying approximate shortest paths in anisotropic regions. SCG 2007: 84-91 - [c11]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 - [c10]Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74 - [c9]Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Approximate shortest paths in anisotropic regions. SODA 2007: 766-774 - [i1]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [j6]Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006) - [j5]Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na:
A note on maximally repeated sub-patterns of a point set. Discret. Math. 306(16): 1965-1968 (2006) - 2005
- [j4]Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na:
Geometric permutations of disjoint unit spheres. Comput. Geom. 30(3): 253-270 (2005) - [c8]Mordecai J. Golin, Hyeon-Suk Na:
Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172 - 2004
- [c7]Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267 - [c6]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - 2003
- [j3]Mordecai J. Golin, Hyeon-Suk Na:
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Comput. Geom. 25(3): 197-231 (2003) - [j2]Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean:
The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) - [c5]Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na:
Disjoint Unit Spheres admit at Most Two Line Transversals. ESA 2003: 127-135 - 2002
- [j1]Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong:
Voronoi diagrams on the spher. Comput. Geom. 23(2): 183-194 (2002) - [c4]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 - [c3]Mordecai J. Golin, Hyeon-Suk Na:
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. SCG 2002: 209-216 - 2001
- [c2]Mordecai J. Golin, Hyeon-Suk Na:
Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference 2001: 143-152 - 2000
- [c1]Mordecai J. Golin, Hyeon-Suk Na:
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG 2000
Coauthor Index
aka: Peter Brass
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-07 22:12 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:
