( en | de | ru )

 

Disambiguation of "Shin, Chan-Su"

Author of the publication

copydeleteadd this publication to your clipboard
Facility Location and the Geometric Minimum-Diameter Spanning Tree.

, , , , and . APPROX, volume 2462 of Lecture Notes in Computer Science, page 146-160. Springer, (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

Computing k-Centers On a Line, , , , and . CoRR, (2009)A Note on Minimum-Cost Coverage by Aligned Disks. CoRR, (2012)Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons., , and . CoRR, (2015)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)Area Bounds of Rectilinear Polygons Realized by Angle Sequences., , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 629-638. Springer, (2012)Tight bounds for beacon-based coverage in simple rectilinear polygons., , and . Comput. Geom., (2019)Guest Editor's Foreword., and . Algorithmica, 76 (4): 1158-1159 (2016)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)Covering Points with Convex Sets of Minimum Size., , , and . WALCOM, volume 9627 of Lecture Notes in Computer Science, page 166-178. Springer, (2016)Computing Farthest Neighbors on a Convex Polytope., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 159-169. Springer, (2001)