From post

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.

 

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

Linear-time nearest point algorithms for coxeter lattices., , и . IEEE Trans. Inf. Theory, 56 (3): 1015-1022 (2010)Shallow Excluded Minors and Improved Graph Decompositions., , и . SODA, стр. 462-470. ACM/SIAM, (1994)Approximating Geometrical Graphs via "Spanners" and "Banyans"., и . STOC, стр. 540-550. ACM, (1998)A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra., и . SCG, стр. 177-185. ACM, (1992)DNA computers in vitro and vivo.. DNA Based Computers, том 27 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 121-185. DIMACS/AMS, (1995)Geometric Separator Theorems & Applications., и . FOCS, стр. 232-243. IEEE Computer Society, (1998)Novel method for quantitative assessment of physical workload of healthcare workers by a tetherless ergonomics workstation., , , и . EMBC, стр. 1570-1573. IEEE, (2012)Best Play for Imperfect Players and Game Tree Search, и . (1993)Graph-Theoretical Conditions for Inscribability and Delaunay Realizability., и . CCCG, стр. 287-292. University of Saskatchewan, (1994)A Simple Method for Resolving Degeneracies in Delaunay Triangulations., и . ICALP, том 700 из Lecture Notes in Computer Science, стр. 177-188. Springer, (1993)