( en | de | ru )

 

Disambiguation of "Cheong, Otfried"

Author of the publication

copydeleteadd this publication to your clipboard
Computing a Minimum-Dilation Spanning Tree is NP-hard.

, , and . CATS, volume 65 of CRPIT, page 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. You can also use the button next to the name to display some publications already assigned to the person.

Eunhae Cheong

Eun Cheong

Chul Cheong

Kit Cheong

Cheong-Min Kim

 

Other publications of authors with the same name

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