( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Experimental Study of Old and New Depth Measures.

, , , и . ALENEX, стр. 51-64. SIAM, (2006)

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.

Nadja Diane

Diane Wischner

Diane Reinstädler

Diane Ripperger

Diane Dingeldein

 

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

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs., , , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 902-912. Springer, (2009)Compatible Geometric Matchings., , , , , , , , , и 3 other автор(ы). Electron. Notes Discret. Math., (2008)Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case., , и . Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, том 72 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 195-209. DIMACS/AMS, (2003)Bounded-degree polyhedronization of point sets., , , , , , , , , и 1 other автор(ы). CCCG, стр. 99-102. (2010)Computational Geometry in a Curved World., и . Algorithmica, 5 (3): 421-457 (1990)Convex Partitions with 2-Edge Connected Dual Graphs., , , , и . COCOON, том 5609 из Lecture Notes in Computer Science, стр. 192-204. Springer, (2009)On Solving Geometric Optimization Problems Using Shortest Paths., и . SCG, стр. 350-359. ACM, (1990)Testing Shortcuts to Maintain Simplicity in Subdivision Simplification., , , и . CCCG, стр. 35-38. (2005)Topological Sweep in Degenerate Cases., , и . ALENEX, том 2409 из Lecture Notes in Computer Science, стр. 155-165. Springer, (2002)Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs., , , , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 204-216. Springer, (2017)