dblp.uni-trier.dewww.uni-trier.de

Chan-Su Shin Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
41EEPeter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Computing k-Centers On a Line CoRR abs/0902.3282: (2009)
40EEPeter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009)
39EEHee-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)
38EEHee-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)
2008
37EEHee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin: Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679
36EEHee-Kap Ahn, Peter Brass, Chan-Su Shin: Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40(2): 171-177 (2008)
35EERobert Görke, Chan-Su Shin, Alexander Wolff: Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geometry Appl. 18(4): 275-294 (2008)
2007
34EEHee-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
33EEXavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112
32EEPeter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74
31EEXavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane CoRR abs/0706.1002: (2007)
30EEHee-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)
29EEHee-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): 3-15 (2007)
2006
28EEHee-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)
27EEOvidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006)
26EEKyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin: Guarding Art Galleries by Guarding Witnesses. Int. J. Comput. Geometry Appl. 16(2-3): 205-226 (2006)
2005
25EESheung-Hung Poon, Chan-Su Shin: Adaptive Zooming in Point Set Labeling. FCT 2005: 233-244
24EEHee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron: Maximizing the overlap of two planar convex sets under rigid motions. Symposium on Computational Geometry 2005: 356-363
2004
23EEHee-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
22EEKyung-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
21EEOvidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75
20EEJoachim 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): 87-106 (2004)
2003
19EESheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff: Labeling Points with Weights. Algorithmica 38(2): 341-362 (2003)
18 Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin: Building bridges between convex region. Comput. Geom. 25(1-2): 161-170 (2003)
17EEOtfried Cheong, Chan-Su Shin, Antoine Vigneron: Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. 296(1): 47-58 (2003)
2002
16EEJoachim 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
15EEOtfried Cheong, Chan-Su Shin, Antoine Vigneron: Computing Farthest Neighbors on a Convex Polytope. COCOON 2001: 159-169
14EESheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff: Labeling Points with Weights. ISAAC 2001: 610-622
13 Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang: Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geometry Appl. 11(2): 167-179 (2001)
12EESung Kwon Kim, Chan-Su Shin: Computing the Optimal Bridge between Two Polygons. Theory Comput. Syst. 34(4): 337-352 (2001)
2000
11EESung Kwon Kim, Chan-Su Shin: Efficient Algorithms for Two-Center Problems for a Convex Polygon. COCOON 2000: 299-309
10 Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa: Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15(4): 175-202 (2000)
9EESung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang: Placing two disks in a convex polygon. Inf. Process. Lett. 73(1-2): 33-39 (2000)
8 Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa: Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. J. Parallel Distrib. Comput. 60(6): 775-783 (2000)
1998
7EEChan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa: Two-Center Problems for a Convex Polygon (Extended Abstract). ESA 1998: 199-210
6EEJoonsoo Choi, Chan-Su Shin, Sung Kwon Kim: Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC 1998: 29-38
5EEChan-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)
4EEChan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa: The Widest k-Dense Corridor Problems. Inf. Process. Lett. 68(1): 25-31 (1998)
1997
3EEJae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa: New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. Symposium on Computational Geometry 1997: 427-429
1996
2 Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa: Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). COCOON 1996: 106-116
1EEJae-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

1Hee-Kap Ahn [18] [23] [24] [28] [29] [30] [34] [36] [37] [38] [39]
2Helmut Alt [30] [34] [38]
3Tetsuo Asano [30] [34] [38]
4Sang Won Bae [30] [34] [38]
5Peter Braß (Peter Brass) [23] [28] [30] [32] [34] [36] [37] [38] [39] [40] [41]
6Otfried Cheong (Otfried Schwarzkopf) [15] [17] [18] [23] [24] [28] [29] [30] [34] [38]
7Joonsoo Choi [6]
8Kyung-Yong Chwa [1] [2] [3] [4] [5] [7] [8] [10] [22] [26]
9Ovidiu Daescu [21] [27]
10Xavier Goaoc [31] [33]
11Robert Görke [35]
12Joachim Gudmundsson [16] [20]
13Herman J. Haverkort [16] [20]
14Byung-Cheol Jo [22] [26]
15Jae-Hoon Kim [3]
16Jung-Hyun Kim [7]
17Kyue D. Kim [32] [40]
18Sung Kwon Kim [2] [5] [6] [7] [9] [10] [11] [12] [13]
19Sung-Ho Kim [5]
20Christian Knauer [22] [26] [30] [34] [37] [38] [41]
21Jan Kratochvíl [31] [33]
22Jae-Ha Lee [1] [3] [8]
23Ningfang Mi [21] [27]
24Esther Moet [22] [26]
25Hyeon-Suk Na [23] [28] [30] [32] [34] [37] [38] [39] [40] [41]
26Yoshio Okamoto [31] [33]
27René van Oostrum [22] [26]
28Chong-Dae Park [24] [29]
29Sang-Min Park [16] [20]
30Sheung-Hung Poon [14] [19] [25]
31Sung Yong Shin [3] [4]
32Tycho Strijk [14] [19]
33Takeaki Uno [19]
34Antoine Vigneron [15] [17] [23] [24] [28] [29] [41]
35Alexander Wolff [14] [16] [19] [20] [21] [27] [30] [31] [33] [34] [35] [38]
36Tae-Cheon Yang [9] [13]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)