Chan-Su Shin - RankMe

80 papers A 3B 14C 1Misc 4Journal 47Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Inscribed and circumscribed histogons of a convex polygon. Comput. Geom. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2025	J	`jnl`	Largest unit rectangles inscribed in a convex polygon. Comput. Geom. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2022	—	`conf`	Approximating Convex Polygons by Histogons. CCCG Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2022	—	`conf`	Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2022	J	`jnl`	Minimum rectilinear polygons for given angle sequences. Comput. Geom. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2022	J	`jnl`	Reachability of turn sequences. CoRR William S. Evans, Noushin Saeedi, Chan-Su Shin, Hyun Tark
2019	J	`jnl`	Area bounds of rectilinear polygons realized by angle sequences. Comput. Geom. Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
2019	J	`jnl`	Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2019	A	`conf`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2019	J	`jnl`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2019	J	`jnl`	The minimum convex container of two convex polytopes under translations. Comput. Geom. Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
2019	J	`jnl`	Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom. Sang Won Bae, Chan-Su Shin, Antoine Vigneron
2018	J	`jnl`	Covering points with convex sets of minimum size. Theor. Comput. Sci. Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
2018	B	`conf`	Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2016	B	`conf`	Covering Points with Convex Sets of Minimum Size. WALCOM Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
2016	J	`jnl`	Guest Editor's Foreword. Algorithmica Hee-Kap Ahn, Chan-Su Shin
2016	J	`jnl`	Minimum Rectilinear Polygons for Given Angle Sequences. CoRR William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2016	B	`conf`	Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. LATIN Sang Won Bae, Chan-Su Shin, Antoine Vigneron
2015	J	`jnl`	Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. CoRR Sang Won Bae, Chan-Su Shin, Antoine Vigneron
2015	J	`jnl`	Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. Theor. Comput. Sci. Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2015	—	`conf`	Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2014	B	`ed.`	Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings ISAAC Hee-Kap Ahn, Chan-Su Shin
2014	C	`conf`	Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. AAIM Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2014	—	`conf`	Minimum Convex Container of Two Convex Polytopes under Translations. CCCG Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin
2013	J	`jnl`	A note on minimum-sum coverage by aligned disks. Inf. Process. Lett. Chan-Su Shin
2013	J	`jnl`	Covering and piercing disks with two centers. Comput. Geom. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2013	J	`jnl`	Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. CoRR Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2013	—	`conf`	Range-Aggregate Queries for Geometric Extent Problems. CATS Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan
2013	J	`jnl`	Realistic roofs over a rectilinear polygon. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
2012	J	`jnl`	A Note on Minimum-Cost Coverage by Aligned Disks CoRR Chan-Su Shin
2012	B	`conf`	Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
2012	J	`jnl`	Covering and Piercing Disks with Two Centers CoRR Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2012	J	`jnl`	The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications. Int. J. Comput. Geom. Appl. Sang Won Bae, Chan-Su Shin
2011	B	`conf`	Covering and Piercing Disks with Two Centers. ISAAC Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2011	B	`conf`	Generating Realistic Roofs over a Rectilinear Polygon. ISAAC Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
2011	J	`jnl`	The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2010	J	`jnl`	Covering a simple polygon by monotone directions. Comput. Geom. Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
2010	J	`jnl`	Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geom. Appl. Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2010	—	`conf`	The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) Sang Won Bae, Chan-Su Shin
2009	J	`jnl`	Computing k-Centers On a Line CoRR Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2009	J	`jnl`	Constructing Optimal Highways. Int. J. Found. Comput. Sci. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2009	J	`jnl`	Escaping offline searchers and isoperimetric theorems. Comput. Geom. Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
2009	J	`jnl`	On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2009	J	`jnl`	Untangling a Planar Graph. Discret. Comput. Geom. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
2008	J	`jnl`	Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geom. Appl. Robert Görke, Chan-Su Shin, Alexander Wolff
2008	B	`conf`	Covering a Simple Polygon by Monotone Directions. ISAAC Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
2008	J	`jnl`	Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. Hee-Kap Ahn, Peter Brass, Chan-Su Shin
2007	J	`jnl`	Constructing Optimal Highways CoRR Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	—	`conf`	Constructing Optimal Highways. CATS Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	B	`conf`	Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
2007	J	`jnl`	Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
2007	A	`conf`	Moving Vertices to Make Drawings Plane. GD Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
2006	J	`jnl`	Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
2006	J	`jnl`	Guarding Art Galleries by Guarding Witnesses. Int. J. Comput. Geom. Appl. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
2006	J	`jnl`	Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2005	B	`conf`	Adaptive Zooming in Point Set Labeling. FCT Sheung-Hung Poon, Chan-Su Shin
2005	—	`conf`	Maximizing the overlap of two planar convex sets under rigid motions. SCG Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
2004	Misc	`conf`	Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2004	J	`jnl`	Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
2004	—	`conf`	Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
2004	B	`conf`	Guarding Art Galleries by Guarding Witnesses. ISAAC Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
2004	J	`jnl`	Labeling Points with Weights. Algorithmica Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
2003	J	`jnl`	Building bridges between convex region. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin
2003	J	`jnl`	Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
2002	—	`conf`	Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
2001	Misc	`conf`	Computing Farthest Neighbors on a Convex Polytope. COCOON Otfried Cheong, Chan-Su Shin, Antoine Vigneron
2001	J	`jnl`	Computing the Optimal Bridge between Two Polygons. Theory Comput. Syst. Sung Kwon Kim, Chan-Su Shin
2001	B	`conf`	Labeling Points with Weights. ISAAC Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff
2001	J	`jnl`	Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geom. Appl. Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
2000	J	`jnl`	Area-efficient algorithms for straight-line tree drawings. Comput. Geom. Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
2000	Misc	`conf`	Efficient Algorithms for Two-Center Problems for a Convex Polygon. COCOON Sung Kwon Kim, Chan-Su Shin
2000	J	`jnl`	Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. J. Parallel Distributed Comput. Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
2000	J	`jnl`	Placing two disks in a convex polygon. Inf. Process. Lett. Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
1998	J	`jnl`	Algorithms for Drawing Binary Trees in the Plane. Inf. Process. Lett. Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa
1998	B	`conf`	Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim
1998	J	`jnl`	The Widest Inf. Process. Lett. Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa
1998	A	`conf`	Two-Center Problems for a Convex Polygon (Extended Abstract). ESA Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
1997	—	`conf`	New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. SCG Jae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa
1996	Misc	`conf`	Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). COCOON Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
1996	B	`conf`	Directed Hamiltonian Packing in ISAAC Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa