( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Locked and Unlocked Polygonal Chains in Three Dimensions.

, , , , , , , , , , и . Discret. Comput. Geom., 26 (3): 269-281 (2001)

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.

H -H Kaatz

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Florian H H Giesert

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)

Lobna H airall h

 

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

Indicative routes for path planning and crowd simulation., , и . FDG, стр. 113-120. ACM, (2009)Intersection Queries for Curved Objects (Extended Abstract)., , и . SCG, стр. 41-50. ACM, (1991)Algorithms for Motion and Navigation in Virtual Environments and Games.. WAFR, том 7 из Springer Tracts in Advanced Robotics, стр. 1-6. Springer, (2002)Efficient Ray Shooting and Hidden Surface Removal, , , , и . Algorithmica, 12 (1): 30―53 (июля 1994)Reachability Analysis of Sampling Based Planners., и . ICRA, стр. 404-410. IEEE, (2005)Dynamization of Order Decomposable Set Problems.. J. Algorithms, 2 (3): 245-260 (1981)Corrigendum: J. Algorithms 4(3): 301 (1983).Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks., , и . SODA, стр. 516-525. SIAM, (2004)TSP with Neighborhoods of Varying Size., , , , , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 187-199. Springer, (2002)The Art of Dynamizing., и . MFCS, том 118 из Lecture Notes in Computer Science, стр. 121-131. Springer, (1981)Connectability Problems.. SWAT, том 318 из Lecture Notes in Computer Science, стр. 105-112. Springer, (1988)