( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hyperplane separability and convexity of probabilistic point sets.

, , , и . J. Comput. Geom., 8 (2): 32-57 (2017)

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.

Niranjan Suri

Subhash Lakshminarayana

Sahil Suri

Subhash Chandra

Heidi Suri

 

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

Label placement by maximum independent set in rectangles., , и . Comput. Geom., 11 (3-4): 209-218 (1998)Finding a Shortest Diagonal of a Simple Polygon in Linear Time., и . Comput. Geom., (1997)On the Most Likely Convex Hull of Uncertain Points., , и . ESA, том 8125 из Lecture Notes in Computer Science, стр. 791-802. Springer, (2013)Fair Covering of Points by Balls., , , и . CCCG, стр. 26-32. (2020)Improved Approximation Bounds for the Minimum Constraint Removal Problem., , , и . APPROX-RANDOM, том 116 из LIPIcs, стр. 2:1-2:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Containment and Evasion in Stochastic Point Data., и . LATIN, том 9644 из Lecture Notes in Computer Science, стр. 576-589. Springer, (2016)Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space., , и . IJCAI, стр. 475-481. ijcai.org, (2022)A Constant Bound for Geometric Permutations of Disjoint Unit Balls., , и . Discret. Comput. Geom., 29 (2): 161-173 (2003)Fast Matching Algorithms for Points on a Polygon (Extended Abstract), и . FOCS, стр. 60-65. IEEE Computer Society, (1989)Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order., , и . ICDE, стр. 924-935. IEEE Computer Society, (2010)