Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). - Chan-Su Shin; Sung Kwon Kim; Kyung-Yong Chwa (COCOON, 1996)

Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). - Jae-Ha Lee; Chan-Su Shin; Kyung-Yong Chwa (ISAAC, 1996)

New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. - Jae-Ha Lee; Chan-Su Shin; Jae-Hoon Kim 001; Sung Yong Shin; Kyung-Yong Chwa (SCG, 1997)

Two-Center Problems for a Convex Polygon (Extended Abstract). - Chan-Su Shin; Jung-Hyun Kim; Sung Kwon Kim; Kyung-Yong Chwa (ESA, 1998)

Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. - Joonsoo Choi; Chan-Su Shin; Sung Kwon Kim (ISAAC, 1998)

Algorithms for Drawing Binary Trees in the Plane. - Chan-Su Shin; Sung Kwon Kim; Sung-Ho Kim 001; Kyung-Yong Chwa (Inf. Process. Lett., 1998)

The Widest k-Dense Corridor Problems. - Chan-Su Shin; Sung Yong Shin; Kyung-Yong Chwa (Inf. Process. Lett., 1998)

Efficient Algorithms for Two-Center Problems for a Convex Polygon. - Sung Kwon Kim; Chan-Su Shin (COCOON, 2000)

Area-efficient algorithms for straight-line tree drawings. - Chan-Su Shin; Sung Kwon Kim; Kyung-Yong Chwa (Comput. Geom., 2000)

Placing two disks in a convex polygon. - Sung Kwon Kim; Chan-Su Shin; Tae-Cheon Yang (Inf. Process. Lett., 2000)

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. - Jae-Ha Lee; Chan-Su Shin; Kyung-Yong Chwa (J. Parallel Distributed Comput., 2000)

Labeling Points with Weights. - Sheung-Hung Poon; Chan-Su Shin; Tycho Strijk; Alexander Wolff 001 (ISAAC, 2001)

Labeling a Rectilinear Map with Sliding Labels. - Sung Kwon Kim; Chan-Su Shin; Tae-Cheon Yang (Int. J. Comput. Geom. Appl., 2001)

Computing the Optimal Bridge between Two Polygons. - Sung Kwon Kim; Chan-Su Shin (Theory Comput. Syst., 2001)

Building bridges between convex region. - Hee-Kap Ahn; Otfried Cheong; Chan-Su Shin (Comput. Geom., 2003)

Computing farthest neighbors on a convex polytope. - Otfried Cheong; Chan-Su Shin; Antoine Vigneron (Theor. Comput. Sci., 2003)

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (COCOON, 2004)

Labeling Points with Weights. - Sheung-Hung Poon; Chan-Su Shin; Tycho Strijk; Takeaki Uno; Alexander Wolff 001 (Algorithmica, 2004)

Facility location and the geometric minimum-diameter spanning tree. - Joachim Gudmundsson; Herman J. Haverkort; Sang-Min Park; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2004)

Adaptive Zooming in Point Set Labeling. - Sheung-Hung Poon; Chan-Su Shin (FCT, 2005)

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2006)

Farthest-point queries with geometric and combinatorial constraints. - Ovidiu Daescu; Ningfang Mi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2006)

Guarding Art Galleries by Guarding Witnesses. - Kyung-Yong Chwa; Byung-Cheol Jo; Christian Knauer; Esther Moet; René van Oostrum; Chan-Su Shin (Int. J. Comput. Geom. Appl., 2006)

Moving Vertices to Make Drawings Plane. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Alexander Wolff 001 (GD, 2007)

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. - Peter Brass; Kyue D. Kim; Hyeon-Suk Na; Chan-Su Shin (ISAAC, 2007)

Maximizing the overlap of two planar convex sets under rigid motions. - Hee-Kap Ahn; Otfried Cheong; Chong-Dae Park; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2007)

Maximum overlap and minimum convex hull of two convex polyhedra under translations. - Hee-Kap Ahn; Peter Brass; Chan-Su Shin (Comput. Geom., 2008)

Constructing the City Voronoi Diagram Faster. - Robert Görke; Chan-Su Shin; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2008)

On the minimum total length of interval systems expressing all intervals, and range-restricted queries. - Hee-Kap Ahn; Peter Brass; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2009)

Escaping offline searchers and isoperimetric theorems. - Peter Brass; Kyue D. Kim; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2009)

Computing k-Centers On a Line - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (CoRR, 2009)

Untangling a Planar Graph. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner 001; Alexander Wolff 001 (Discret. Comput. Geom., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). - Sang Won Bae 001; Chan-Su Shin (ISAAC (2), 2010)

Covering a simple polygon by monotone directions. - Hee-Kap Ahn; Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2010)

Guarding a Polygon from Two Nearly-Opposite Directions. - Peter Brass; Hyeon-Suk Na; Chan-Su Shin (Int. J. Comput. Geom. Appl., 2010)

Generating Realistic Roofs over a Rectilinear Polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (ISAAC, 2011)

The Aligned k-Center Problem. - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2011)

A Note on Minimum-Cost Coverage by Aligned Disks - Chan-Su Shin (CoRR, 2012)

The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. - Sang Won Bae 001; Chan-Su Shin (Int. J. Comput. Geom. Appl., 2012)

Range-Aggregate Queries for Geometric Extent Problems. - Peter Brass; Christian Knauer; Chan-Su Shin; Michiel H. M. Smid; Ivo Vigan (CATS, 2013)

Realistic roofs over a rectilinear polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Covering and piercing disks with two centers. - Hee-Kap Ahn; Sang-Sub Kim 001; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

A note on minimum-sum coverage by aligned disks. - Chan-Su Shin (Inf. Process. Lett., 2013)

Minimum Convex Container of Two Convex Polytopes under Translations. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Dongwoo Park; Chan-Su Shin (CCCG, 2014)

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (CoRR, 2015)

Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. - Peter Brass; Hyeon-Suk Na; Chan-Su Shin (Theor. Comput. Sci., 2015)

Covering Points with Convex Sets of Minimum Size. - Hwan-Gue Cho; William S. Evans; Noushin Saeedi; Chan-Su Shin (WALCOM, 2016)

Guest Editor's Foreword. - Hee-Kap Ahn; Chan-Su Shin (Algorithmica, 2016)

Covering points with convex sets of minimum size. - Sang Won Bae 001; Hwan-Gue Cho; William S. Evans; Noushin Saeedi; Chan-Su Shin (Theor. Comput. Sci., 2018)

Representing Graphs and Hypergraphs by Touching Polygons in 3D. - William S. Evans; Pawel Rzazewski; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (GD, 2019)

The minimum convex container of two convex polytopes under translations. - Hee-Kap Ahn; Judit Abardia; Sang Won Bae 001; Otfried Cheong; Susanna Dann; Dongwoo Park; Chan-Su Shin (Comput. Geom., 2019)

Area bounds of rectilinear polygons realized by angle sequences. - Sang Won Bae 001; Yoshio Okamoto; Chan-Su Shin (Comput. Geom., 2019)

Tight bounds for beacon-based coverage in simple rectilinear polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2019)

Minimum-width annulus with outliers: Circular, square, and rectangular cases. - Hee-Kap Ahn; Taehoon Ahn 001; Sang Won Bae 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001; Chan-Su Shin; Sang Duk Yoon (Inf. Process. Lett., 2019)

Approximating Convex Polygons by Histogons. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (CCCG, 2022)

Inscribing or Circumscribing a Histogon to a Convex Polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (FSTTCS, 2022)

Minimum rectilinear polygons for given angle sequences. - William S. Evans; Krzysztof Fleszar 001; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2022)

Reachability of turn sequences. - William S. Evans; Noushin Saeedi; Chan-Su Shin; Hyun Tark (CoRR, 2022)

Largest unit rectangles inscribed in a convex polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (Comput. Geom., 2025)