default search action
Chan-Su Shin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j36]William S. Evans
, Krzysztof Fleszar
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022) - [c32]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Approximating Convex Polygons by Histogons. CCCG 2022: 75-82 - [c31]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS 2022: 13:1-13:16 - [i9]William S. Evans, Noushin Saeedi, Chan-Su Shin, Hyun Tark:
Reachability of turn sequences. CoRR abs/2203.00855 (2022)
2010 – 2019
- 2019
- [j35]Hee-Kap Ahn
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77: 40-50 (2019) - [j34]Sang Won Bae
Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom. 80: 40-52 (2019) - [j33]Sang Won Bae
Area bounds of rectilinear polygons realized by angle sequences. Comput. Geom. 83: 9-29 (2019) - [j32]Hee-Kap Ahn
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145: 16-23 (2019) - [c30]William S. Evans, Pawel Rzazewski
Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD 2019: 18-32 - [i8]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR abs/1908.08273 (2019) - 2018
- [j31]Sang Won Bae
Covering points with convex sets of minimum size. Theor. Comput. Sci. 718: 14-23 (2018) - [c29]Hee-Kap Ahn
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM 2018: 44-55 - 2016
- [j30]Hee-Kap Ahn
Guest Editor's Foreword. Algorithmica 76(4): 1158-1159 (2016) - [c28]Sang Won Bae
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. LATIN 2016: 110-122 - [c27]Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
Covering Points with Convex Sets of Minimum Size. WALCOM 2016: 166-178 - [i7]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR abs/1606.06940 (2016) - 2015
- [j29]Peter Brass
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. Theor. Comput. Sci. 607: 96-112 (2015) - [c26]William S. Evans, Krzysztof Fleszar, Philipp Kindermann
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG 2015: 105-119 - [i6]Sang Won Bae, Chan-Su Shin, Antoine Vigneron:
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. CoRR abs/1505.05106 (2015) - 2014
- [c25]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 - [c24]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG 2014 - [e1]Hee-Kap Ahn, Chan-Su Shin:
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Lecture Notes in Computer Science 8889, Springer 2014, ISBN 978-3-319-13074-3 [contents] - 2013
- [j28]Hee-Kap Ahn
Covering and piercing disks with two centers. Comput. Geom. 46(3): 253-262 (2013) - [j27]Hee-Kap Ahn
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [j26]Chan-Su Shin
A note on minimum-sum coverage by aligned disks. Inf. Process. Lett. 113(22-24): 871-875 (2013) - [c23]Peter Brass
Range-Aggregate Queries for Geometric Extent Problems. CATS 2013: 3-10 - [i5]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) - 2012
- [j25]Sang Won Bae
The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. Int. J. Comput. Geom. Appl. 22(1): 3-26 (2012) - [c22]Sang Won Bae, Yoshio Okamoto, Chan-Su Shin:
Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC 2012: 629-638 - [i4]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers. CoRR abs/1201.1198 (2012) - [i3]Chan-Su Shin:
A Note on Minimum-Cost Coverage by Aligned Disks. CoRR abs/1202.4821 (2012) - 2011
- [j24]Peter Brass
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21(2): 157-178 (2011) - [c21]Hee-Kap Ahn
Covering and Piercing Disks with Two Centers. ISAAC 2011: 50-59 - [c20]Hee-Kap Ahn
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - 2010
- [j23]Hee-Kap Ahn
Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010) - [j22]Peter Brass
Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geom. Appl. 20(3): 327-339 (2010) - [c19]Sang Won Bae
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) 2010: 230-241
2000 – 2009
- 2009
- [j21]Peter Brass
Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009) - [j20]Hee-Kap Ahn
On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. 42(3): 207-213 (2009) - [j19]Xavier Goaoc, Jan Kratochvíl
Untangling a Planar Graph. Discret. Comput. Geom. 42(4): 542-569 (2009) - [j18]Hee-Kap Ahn
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
- [j17]Hee-Kap Ahn
Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40(2): 171-177 (2008) - [j16]Robert Görke, Chan-Su Shin
Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geom. Appl. 18(4): 275-294 (2008) - [c18]Hee-Kap Ahn
Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679 - 2007
- [j15]Hee-Kap Ahn
Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37(1): 3-15 (2007) - [c17]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass
Constructing Optimal Highways. CATS 2007: 7-14 - [c16]Xavier Goaoc, Jan Kratochvíl
Moving Vertices to Make Drawings Plane. GD 2007: 101-112 - [c15]Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74 - [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
- [j14]Hee-Kap Ahn
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006) - [j13]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin
Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006) - [j12]Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
Guarding Art Galleries by Guarding Witnesses. Int. J. Comput. Geom. Appl. 16(2-3): 205-226 (2006) - 2005
- [c14]Hee-Kap Ahn
Maximizing the overlap of two planar convex sets under rigid motions. SCG 2005: 356-363 - [c13]Sheung-Hung Poon, Chan-Su Shin:
Adaptive Zooming in Point Set Labeling. FCT 2005: 233-244 - 2004
- [j11]Sheung-Hung Poon
Labeling Points with Weights. Algorithmica 38(2): 341-362 (2004) - [j10]Joachim Gudmundsson
Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004) - [c12]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 - [c11]Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses. ISAAC 2004: 352-363 - [c10]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin
Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75 - 2003
- [j9]Hee-Kap Ahn
Building bridges between convex region. Comput. Geom. 25(1-2): 161-170 (2003) - [j8]Otfried Cheong
Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. 296(1): 47-58 (2003) - 2002
- [c9]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160 - 2001
- [j7]Sung Kwon Kim, Chan-Su Shin
Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geom. Appl. 11(2): 167-179 (2001) - [j6]Sung Kwon Kim, Chan-Su Shin
Computing the Optimal Bridge between Two Polygons. Theory Comput. Syst. 34(4): 337-352 (2001) - [c8]Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope. COCOON 2001: 159-169 - [c7]Sheung-Hung Poon
Labeling Points with Weights. ISAAC 2001: 610-622 - 2000
- [j5]Chan-Su Shin
Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15(4): 175-202 (2000) - [j4]Sung Kwon Kim, Chan-Su Shin
Placing two disks in a convex polygon. Inf. Process. Lett. 73(1-2): 33-39 (2000) - [j3]Jae-Ha Lee, Chan-Su Shin
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. J. Parallel Distributed Comput. 60(6): 775-783 (2000) - [c6]Sung Kwon Kim, Chan-Su Shin:
Efficient Algorithms for Two-Center Problems for a Convex Polygon. COCOON 2000: 299-309
1990 – 1999
- 1998
- [j2]Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa:
Algorithms for Drawing Binary Trees in the Plane. Inf. Process. Lett. 66(3): 133-139 (1998) - [j1]Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa:
The Widest k-Dense Corridor Problems. Inf. Process. Lett. 68(1): 25-31 (1998) - [c5]Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa:
Two-Center Problems for a Convex Polygon (Extended Abstract). ESA 1998: 199-210 - [c4]Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim:
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC 1998: 29-38 - 1997
- [c3]Jae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa:
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. SCG 1997: 427-429 - 1996
- [c2]Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa:
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). COCOON 1996: 106-116 - [c1]Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa:
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). ISAAC 1996: 295-304
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-07 22:21 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: