( en | de | ru )

 

Disambiguation of "Yap, Chee-Keng"

Author of the publication

copydeleteadd this publication to your clipboard
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves.

, and . ICALP, volume 317 of Lecture Notes in Computer Science, page 410-423. Springer, (1988)

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.

Chee Yap

Fredrick Orori Kengara

Jens Kengelbach

King-Ing Yap

Bevan Cheeseman

 

Other publications of authors with the same name

Shortest Path amidst Disc Obstacles Is Computable., , , , and . Int. J. Comput. Geom. Appl., 16 (5-6): 567-590 (2006)Quantitative Steinitz's Theorems with Applications to Multifingered Grasping, , and . STOC, page 341-351. ACM, (1990)Probing Convex Polytopes, , and . STOC, page 424-432. ACM, (1986)In Praise of Numerical Computation.. Efficient Algorithms, volume 5760 of Lecture Notes in Computer Science, page 380-407. Springer, (2009)k-Link Shortest Paths in Weighted Subdivisions., , , , and . WADS, volume 3608 of Lecture Notes in Computer Science, page 325-337. Springer, (2005)Foundations of Exact Rounding., and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 15-31. Springer, (2009)Quantitative Steinitz's Theorems Applications to Multifingered Grasping., , and . Discret. Comput. Geom., (1992)The Orthogonal Convex Skull Problem., and . Discret. Comput. Geom., (1988)A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration., , , and . CoRR, (2015)Competitive Online Scheduling with Level of Service., and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 453-462. Springer, (2001)