( en | de | ru )

 

Disambiguation of "Shin, Chan-Su"

Author of the publication

copydeleteadd this publication to your clipboard
Farthest-Point Queries with Geometric and Combinatorial Constraints.

, , , and . JCDCG, volume 3742 of Lecture Notes in Computer Science, page 62-75. Springer, (2004)

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

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)Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes., , and . J. Parallel Distributed Comput., 60 (6): 775-783 (2000)Minimum Convex Container of Two Convex Polytopes under Translations., , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)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)Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons., , and . CoRR, (2015)Computing k-Centers On a Line, , , , and . CoRR, (2009)A Note on Minimum-Cost Coverage by Aligned Disks. CoRR, (2012)Computing Farthest Neighbors on a Convex Polytope., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 159-169. Springer, (2001)Tight bounds for beacon-based coverage in simple rectilinear polygons., , and . Comput. Geom., (2019)