( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient algorithm for placing a given number of base stations to cover a convex region.

, , , и . J. Parallel Distributed Comput., 66 (11): 1353-1358 (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.

Constanze Nandy

Subhas Pakrasi

Sagnik Nandy

Subhas Pakrasi

Nandy Putra

 

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

Area(number)-balanced hierarchy of staircase channels with minimum crossing nets., , , и . ISCAS (5), стр. 395-398. IEEE, (2001)On the number of shortest descending paths on the surface of a convex terrain., , , и . J. Discrete Algorithms, 9 (2): 182-189 (2011)On the Geometric Red-Blue Set Cover Problem., , и . WALCOM, том 12635 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2021)A Fast Algorithm for Point Labeling Problem., , , и . CCCG, стр. 155-158. (2005)Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks., , и . IWDC, том 3326 из Lecture Notes in Computer Science, стр. 412-423. Springer, (2004)Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set., , и . Inf. Process. Lett., 102 (4): 163-168 (2007)An Improved Algorithm for Point Set Pattern Matching under Rigid Motion., , , и . CIAC, том 2653 из Lecture Notes in Computer Science, стр. 36-45. Springer, (2003)Variations of largest rectangle recognition amidst a bichromatic point set., , , и . CoRR, (2019)Covering Points: Minimizing the Maximum Depth., , и . CCCG, стр. 37-42. (2017)Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models., , , и . CCCG, Carleton University, Ottawa, Canada, (2014)