Chan-Su Shin

Publication Activity (10 Years)

Years Active: 1996-2022
Publications (10 Years): 16

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

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)
William S. Evans, Noushin Saeedi, Chan-Su Shin, Hyun Tark
Reachability of turn sequences. CoRR (2022)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100 (2022)
Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
Approximating Convex Polygons by Histogons. CCCG (2022)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. Graph Drawing (2019)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR (2019)
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 (2019)
Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77 (2019)
Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
Area bounds of rectilinear polygons realized by angle sequences. Comput. Geom. 83 (2019)
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom. 80 (2019)
Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
Covering points with convex sets of minimum size. Theor. Comput. Sci. 718 (2018)
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)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR (2016)
Hee-Kap Ahn, Chan-Su Shin
Guest Editor's Foreword. Algorithmica 76 (4) (2016)
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. LATIN (2016)
Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
Covering Points with Convex Sets of Minimum Size. WALCOM (2016)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG (2015)
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. CoRR (2015)
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 (2015)
Peter Brass, Hyeon-Suk Na, Chan-Su Shin
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. AAIM (2014)
Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG (2014)
Peter Brass, Hyeon-Suk Na, Chan-Su Shin
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. CoRR (2013)
Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan
Range-Aggregate Queries for Geometric Extent Problems. CATS (2013)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and piercing disks with two centers. Comput. Geom. 46 (3) (2013)
Chan-Su Shin
A note on minimum-sum coverage by aligned disks. Inf. Process. Lett. 113 (22-24) (2013)
Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
Realistic roofs over a rectilinear polygon. Comput. Geom. 46 (9) (2013)
Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC (2012)
Sang Won Bae, Chan-Su Shin
The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. Int. J. Comput. Geom. Appl. 22 (1) (2012)
Chan-Su Shin
A Note on Minimum-Cost Coverage by Aligned Disks CoRR (2012)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers CoRR (2012)
Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21 (2) (2011)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers. ISAAC (2011)
Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC (2011)
Peter Brass, Hyeon-Suk Na, Chan-Su Shin
Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geom. Appl. 20 (3) (2010)
Sang Won Bae, Chan-Su Shin
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) (2010)
Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
Covering a simple polygon by monotone directions. Comput. Geom. 43 (5) (2010)
Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42 (2) (2009)
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) (2009)
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) (2009)
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
Untangling a Planar Graph. Discret. Comput. Geom. 42 (4) (2009)
Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
Computing k-Centers On a Line CoRR (2009)
Robert Görke, Chan-Su Shin, Alexander Wolff
Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geom. Appl. 18 (4) (2008)
Hee-Kap Ahn, Peter Brass, Chan-Su Shin
Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40 (2) (2008)
Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
Covering a Simple Polygon by Monotone Directions. ISAAC (2008)
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)
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37 (1) (2007)
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
Moving Vertices to Make Drawings Plane. Graph Drawing (2007)
Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC (2007)
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 (2007)
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) (2006)
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33 (3) (2006)
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) (2006)
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
Maximizing the overlap of two planar convex sets under rigid motions. SCG (2005)
Sheung-Hung Poon, Chan-Su Shin
Adaptive Zooming in Point Set Labeling. FCT (2005)
Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27 (1) (2004)
Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
Guarding Art Galleries by Guarding Witnesses. ISAAC (2004)
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG (2004)
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)
Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
Labeling Points with Weights. Algorithmica 38 (2) (2004)
Otfried Cheong, Chan-Su Shin, Antoine Vigneron
Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. 296 (1) (2003)
Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin
Building bridges between convex region. Comput. Geom. 25 (1-2) (2003)
Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX (2002)
Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff
Labeling Points with Weights. ISAAC (2001)
Sung Kwon Kim, Chan-Su Shin
Computing the Optimal Bridge between Two Polygons. Theory Comput. Syst. 34 (4) (2001)
Otfried Cheong, Chan-Su Shin, Antoine Vigneron
Computing Farthest Neighbors on a Convex Polytope. COCOON (2001)
Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geom. Appl. 11 (2) (2001)
Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15 (4) (2000)
Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. J. Parallel Distributed Comput. 60 (6) (2000)
Sung Kwon Kim, Chan-Su Shin
Efficient Algorithms for Two-Center Problems for a Convex Polygon. COCOON (2000)
Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
Placing two disks in a convex polygon. Inf. Process. Lett. 73 (1-2) (2000)
Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa
-Dense Corridor Problems. Inf. Process. Lett. 68 (1) (1998)
Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
Two-Center Problems for a Convex Polygon (Extended Abstract). ESA (1998)
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) (1998)
Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC (1998)
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)
Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). COCOON (1996)
Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
-Dimensional Meshes and Its Application (Extended Abstract). ISAAC (1996)