( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing a Minimum-Dilation Spanning Tree is NP-hard.

, , и . CATS, том 65 из CRPIT, стр. 15-24. Australian Computer Society, (2007)

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.

Eunhae Cheong

Eun Cheong

Chul Cheong

Kit Cheong

Cheong-Min Kim

 

Другие публикации лиц с тем же именем

Geometric permutations of non-overlapping unit balls revisited., , , и . Comput. Geom., (2016)Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points., , , , и . ESA, том 1879 из Lecture Notes in Computer Science, стр. 314-325. Springer, (2000)Computation of Non-dominated Points Using Compact Voronoi Diagrams., , , , , и . WALCOM, том 5942 из Lecture Notes in Computer Science, стр. 82-93. Springer, (2010)Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon., , , , , и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 259-267. Springer, (2004)Stacking and Bundling Two Convex Polygons., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 882-891. Springer, (2005)Casting a Polyhedron with Directional Uncertainty., , и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 274-285. Springer, (2002)Disjoint Unit Spheres admit at Most Two Line Transversals., , и . ESA, том 2832 из Lecture Notes in Computer Science, стр. 127-135. Springer, (2003)Spanning Trees Crossing Few Barriers., , , , , и . SCG, стр. 41-48. ACM, (1999)Fitting a Graph to One-Dimensional Data., , и . CCCG, стр. 134-140. (2020)A Generalization of the Convex Kakeya Problem., , , , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2012)