( en | de | ru )

 

Disambiguation of "Shin, Chan-Su"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Geometric Minimum-Diameter Spanning Tree

, , , , and . Proc. 18th European Workshop on Computational Geometry (EWCG'02), page 41--45. War\-szawa, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chan Ho Shin

Su Chan Ho

Yong-su Shin

Chan-Su Yun

Su-Shin Ang

 

Other publications of authors with the same name

Maximizing the overlap of two planar convex sets under rigid motions., , , , and . SCG, page 356-363. ACM, (2005)Computing k-Centers On a Line, , , , and . CoRR, (2009)A Note on Minimum-Cost Coverage by Aligned Disks. CoRR, (2012)Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 295-304. Springer, (1996)Covering Points with Convex Sets of Minimum Size., , , and . WALCOM, volume 9627 of Lecture Notes in Computer Science, page 166-178. Springer, (2016)Efficient Algorithms for Two-Center Problems for a Convex Polygon., and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 299-309. Springer, (2000)Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 1-12. Springer, (2014)Computing Farthest Neighbors on a Convex Polytope., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 159-169. Springer, (2001)Covering a Simple Polygon by Monotone Directions., , , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 668-679. Springer, (2008)Approximating Convex Polygons by Histogons., , , , and . CCCG, page 75-82. (2022)