( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
k-Link Shortest Paths in Weighted Subdivisions.

, , , , и . WADS, том 3608 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2005)

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.

Chee Yap

Fredrick Orori Kengara

Jens Kengelbach

King-Ing Yap

Bevan Cheeseman

 

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

Probing Convex Polytopes, , и . STOC, стр. 424-432. ACM, (1986)Quantitative Steinitz's Theorems with Applications to Multifingered Grasping, , и . STOC, стр. 341-351. ACM, (1990)Foundations of Exact Rounding., и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 15-31. Springer, (2009)k-Link Shortest Paths in Weighted Subdivisions., , , , и . WADS, том 3608 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2005)In Praise of Numerical Computation.. Efficient Algorithms, том 5760 из Lecture Notes in Computer Science, стр. 380-407. Springer, (2009)Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach., и . SCG, стр. 351-360. ACM, (2009)Certified computation of planar morse-smale complexes., , и . SCG, стр. 259-268. ACM, (2012)On Simultaneous Inner and Outer Approximation of Shapes., , , , и . SCG, стр. 216-224. ACM, (1990)Competitive Online Scheduling with Level of Service., и . COCOON, том 2108 из Lecture Notes in Computer Science, стр. 453-462. Springer, (2001)Shortest Path amidst Disc Obstacles Is Computable., , , , и . Int. J. Comput. Geom. Appl., 16 (5-6): 567-590 (2006)