( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing the Gromov-Hausdorff Distance for Metric Trees.

, , , , и . CoRR, (2015)

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.

Pankaj Singh

Pankaj Basu

Shireesh Pankaj

Pankaj Goyal

Jugalkishor Agarwal

 

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

Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons., , и . WABI, том 3692 из Lecture Notes in Computer Science, стр. 315-327. Springer, (2005)Modeling and Analyzing Massive Terrain Data Sets.. ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 1. Springer, (2007)Star Unfolding of a Polytope with Applications (Extended Abstract)., , , и . SWAT, том 447 из Lecture Notes in Computer Science, стр. 251-263. Springer, (1990)Sparsification of motion-planning roadmaps by edge contraction., , , и . ICRA, стр. 4098-4105. IEEE, (2013)Computing a Center-Transversal Line., , , и . FSTTCS, том 4337 из Lecture Notes in Computer Science, стр. 93-104. Springer, (2006)Approximation Algorithms for k-Line Center., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 54-63. Springer, (2002)Computing Shortest Paths in the Plane with Removable Obstacles., , , и . SWAT, том 101 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings., , , и . SODA, стр. 4514-4529. SIAM, (2024)Decomposing the Complement of the Union of Cubes in Three Dimensions., , и . SODA, стр. 1425-1444. SIAM, (2021)An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles., , и . SODA, стр. 1179-1192. SIAM, (2016)