The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chan-Su Shin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility Location and the Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:146-160 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:259-267 [Conf]
  3. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
    Computing Farthest Neighbors on a Convex Polytope. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:159-169 [Conf]
  4. Sung Kwon Kim, Chan-Su Shin
    Efficient Algorithms for Two-Center Problems for a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:299-309 [Conf]
  5. Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
    Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:106-116 [Conf]
  6. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
    Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:356-363 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:427-429 [Conf]
  8. Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
    Two-Center Problems for a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:199-210 [Conf]
  9. Sheung-Hung Poon, Chan-Su Shin
    Adaptive Zooming in Point Set Labeling. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:233-244 [Conf]
  10. Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim
    Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:29-38 [Conf]
  11. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
    Guarding Art Galleries by Guarding Witnesses. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:352-363 [Conf]
  12. Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
    Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:295-304 [Conf]
  13. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff
    Labeling Points with Weights. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:610-622 [Conf]
  14. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
    Farthest-Point Queries with Geometric and Combinatorial Constraints. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:62-75 [Conf]
  15. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
    Labeling Points with Weights. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:341-362 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:152-164 [Journal]
  17. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin
    Building bridges between convex region. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:161-170 [Journal]
  18. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
    Farthest-point queries with geometric and combinatorial constraints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:174-185 [Journal]
  19. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility location and the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:87-106 [Journal]
  20. Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
    Area-efficient algorithms for straight-line tree drawings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:15, n:4, pp:175-202 [Journal]
  21. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
    Guarding Art Galleries by Guarding Witnesses. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:205-226 [Journal]
  22. Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
    Labeling a Rectilinear Map with Sliding Labels. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:167-179 [Journal]
  23. Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang
    Placing two disks in a convex polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:33-39 [Journal]
  24. Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa
    Algorithms for Drawing Binary Trees in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:3, pp:133-139 [Journal]
  25. Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa
    The Widest k-Dense Corridor Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:25-31 [Journal]
  26. Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
    Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:6, pp:775-783 [Journal]
  27. Sung Kwon Kim, Chan-Su Shin
    Computing the Optimal Bridge between Two Polygons. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:4, pp:337-352 [Journal]
  28. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
    Computing farthest neighbors on a convex polytope. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:47-58 [Journal]
  29. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
    Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:3-15 [Journal]
  30. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  31. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
    Moving Vertices to Make Drawings Plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  32. Constructing Optimal Highways. [Citation Graph (, )][DBLP]


  33. Moving Vertices to Make Drawings Plane. [Citation Graph (, )][DBLP]


  34. Covering a Simple Polygon by Monotone Directions. [Citation Graph (, )][DBLP]


  35. Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. [Citation Graph (, )][DBLP]


  36. Maximum overlap and minimum convex hull of two convex polyhedra under translations. [Citation Graph (, )][DBLP]


  37. Escaping offline searchers and isoperimetric theorems. [Citation Graph (, )][DBLP]


  38. On the minimum total length of interval systems expressing all intervals, and range-restricted queries. [Citation Graph (, )][DBLP]


  39. Covering a simple polygon by monotone directions. [Citation Graph (, )][DBLP]


  40. Computing k-Centers On a Line [Citation Graph (, )][DBLP]


  41. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002