( en | de | ru )

 

Disambiguation of "Nandy, Subhas C."

Author of the publication

copydeleteadd this publication to your clipboard
Covering Segments with Unit Squares.

, , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 1-12. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Constanze Nandy

Subhas Pakrasi

Sagnik Nandy

Subhas Pakrasi

Nandy Putra

 

Other publications of authors with the same name

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