Smallest color-spanning object revisited. Zbl 1178.65020
Das, Sandip; Goswami, Partha P.; Nandy, Subhas C. |
|
2009
|
Some variations on constrained minimum enclosing circle problem. Zbl 1288.90078
Karmakar, Arindam; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Binay K. |
|
2013
|
Contact CR-warped product submanifolds of \((\operatorname{LCS})_n\)-manifolds. Zbl 1374.53055
Hui, S. K.; Atçeken, M.; Nandy, S. |
|
2017
|
Variations of base-station placement problem on the boundary of a convex region. Zbl 1155.68015
Das, Gautam K.; Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2008
|
Largest empty rectangle among a point set. Zbl 1043.65035
Chaudhuri, Jeet; Nandy, Subhas C.; Das, Sandip |
|
2003
|
Approximation algorithms for maximum independent set of a unit disk graph. Zbl 1317.68272
Das, Gautam K.; De, Minati; Kolay, Sudeshna; Nandy, Subhas C.; Sur-Kolay, Susmita |
|
2015
|
Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation. Zbl 1182.68331
Das, Sandip; Goswami, Partha P.; Nandy, Subhas C. |
|
2005
|
Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment. Zbl 1060.65026
Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2004
|
Shortest monotone descent path problem in polyhedral terrain. Zbl 1117.65037
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2007
|
Approximation algorithms for a variant of discrete piercing set problem for unit disks. Zbl 1318.68182
De, Minati; Das, Gautam K.; Carmi, Paz; Nandy, Subhas C. |
|
2013
|
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Zbl 0939.68504
Nandy, S. C.; Bhattacharya, B. B. |
|
1995
|
Efficient algorithm for placing a given number of base stations to cover a convex region. Zbl 1178.68028
Das, Gautam K.; Das, Sandip; Nandy, Subhas C.; Sinha, Bhabani P. |
|
2006
|
Range assignment for energy efficient broadcasting in linear radio networks. Zbl 1090.90027
Das, Gautam K.; Das, Sandip; Nandy, Subhas C. |
|
2006
|
Simple algorithms for partial point set pattern matching under rigid motion. Zbl 1098.68928
Bishnu, Arijit; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2006
|
Covering segments with unit squares. Zbl 1468.68256
Acharyya, Ankush; Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2019
|
Constrained minimum enclosing circle with center on a query line segment. Zbl 1175.65033
Roy, Sasanka; Karmakar, Arindam; Das, Sandip; Nandy, Subhas C. |
|
2009
|
Homogeneous 2-hop broadcast in 2D. Zbl 1173.90448
Das, Gautam K.; Das, Sandip; Nandy, Subhas C. |
|
2010
|
Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design. Zbl 0733.68090
Nandy, Subhas C.; Bhattacharya, Bhargab B.; Ray, Sibabrata |
|
1990
|
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Zbl 1435.68353
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2019
|
Shattering a set of objects in 2D. Zbl 1052.68141
Nandy, Subhas C.; Asano, Tetsuo; Harayama, Tomohiro |
|
2002
|
New variations of the maximum coverage facility location problem. Zbl 1292.90177
Bhattacharya, Bhaswar B.; Nandy, Subhas C. |
|
2013
|
Location of the largest empty rectangle among arbitrary obstacles. Zbl 1044.68864
Nandy, Subhas C.; Sinha, Arani; Bhattacharya, Bhargab B. |
|
1994
|
On finding an empty staircase polygon of largest area (width) in a planar point-set. Zbl 1027.65027
Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2003
|
Minimum dominating set problem for unit disks revisited. Zbl 1344.68280
Carmi, Paz; Das, Gautam K.; Jallu, Ramesh K.; Nandy, Subhas C.; Prasad, Prajwal R.; Stein, Yael |
|
2015
|
Faster approximation for maximum independent set on unit disk graph. Zbl 1414.68147
Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2017
|
An in-place min-max priority search tree. Zbl 1257.68058
De, Minati; Maheshwari, Anil; Nandy, Subhas C.; Smid, Michiel |
|
2013
|
On the number of shortest descending paths on the surface of a convex terrain. Zbl 1217.90147
Ahmed, Mustaq; Maheshwari, Anil; Nandy, Subhas C.; Roy, Sasanka |
|
2011
|
An efficient \(k\) nearest neighbors searching algorithm for a query line. Zbl 1040.68031
Nandy, Subhas C.; Das, Sandip; Goswami, Partha P. |
|
2003
|
Constrained minimum enclosing circle with center on a query line segment. Zbl 1132.68797
Roy, Sasanka; Karmakar, Arindam; Das, Sandip; Nandy, Subhas C. |
|
2006
|
A generalization of magic squares with applications to digital halftoning. Zbl 1137.05303
Aronov, Boris; Asano, Tetsuo; Kikuchi, Yosuke; Nandy, Subhas C.; Sasahara, Shinji; Uno, Takeaki |
|
2008
|
Two-center of the convex hull of a point set: dynamic model, and restricted streaming model. Zbl 1414.68135
Sadhu, Sanjib; Roy, Sasanka; Nandi, Soumen; Maheshwari, Anil; Nandy, Subhas C. |
|
2019
|
Minimum width color spanning annulus. Zbl 1390.68701
Acharyya, Ankush; Nandy, Subhas C.; Roy, Sasanka |
|
2018
|
Dynamically maintaining the widest \(k\)-dense corridor. Zbl 0974.68218
Nandy, S. C.; Harayama, T.; Asano, T. |
|
2001
|
Maximal empty coboids among points and blocks. Zbl 0939.68145
Nandy, S. C.; Bhattacharya, B. B. |
|
1998
|
Covering segments with unit squares. Zbl 1470.68230
Acharyya, Ankush; Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2017
|
An optimal algorithm for plane matchings in multipartite geometric graphs. Zbl 1444.68273
Biniaz, Ahmad; Maheshwari, Anil; Nandy, Subhas C.; Smid, Michiel |
|
2015
|
Range assignment of base-stations maximizing coverage area without interference. Zbl 1436.68375
Acharyya, Ankush; De, Minati; Nandy, Subhas C.; Roy, Bodhayan |
|
2020
|
Geometric path problems with violations. Zbl 1383.68093
Maheshwari, Anil; Nandy, Subhas C.; Pattanayak, Drimit; Roy, Sasanka; Smid, Michiel |
|
2018
|
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Zbl 1290.52002
Khan, Arindam; Pal, Sudebkumar P.; Aanjaneya, Mridul; Bishnu, Arijit; Nandy, Subhas C. |
|
2013
|
Optimal algorithm for a special point-labeling problem. Zbl 1178.68650
Roy, Sasanka; Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2004
|
Separating multi-color points on a plane with fewest axis-parallel lines. Zbl 1204.68245
Majumder, Subhashis; Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2010
|
Algorithms for computing diffuse reflection paths in polygons. Zbl 1211.68467
Ghosh, Subir Kumar; Goswami, Partha Pratim; Maheshwari, Anil; Nandy, Subhas Chandra; Pal, Sudebkumar Prasant; Sarvattomananda, Swami |
|
2009
|
Minimum consistent subset problem for trees. Zbl 1497.68376
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
Guarding polyhedral terrain by \(k\)-watchtowers. Zbl 1446.68174
Tripathi, Nitesh; Pal, Manjish; De, Minati; Das, Gautam; Nandy, Subhas C. |
|
2018
|
Color spanning objects: algorithms and hardness results. Zbl 1437.68181
Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. |
|
2020
|
Partial enclosure range searching. Zbl 1458.68263
Bint, Gregory; Maheshwari, Anil; Smid, Michiel; Nandy, Subhas C. |
|
2019
|
Variations of largest rectangle recognition amidst a bichromatic point set. Zbl 1453.68198
Acharyya, Ankush; De, Minati; Nandy, Subhas C.; Pandit, Supantha |
|
2020
|
On the geometric red-blue set cover problem. Zbl 07405957
Madireddy, Raghunath Reddy; Nandy, Subhas C.; Pandit, Supantha |
|
2021
|
Discriminating codes in geometric setups. Zbl 07765382
Dey, Sanjana; Foucaud, Florent; Nandy, Subhas C.; Sen, Arunabha |
|
2020
|
Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares”. Zbl 1435.68352
Sadhu, Sanjib; He, Xiaozhou; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2020
|
Minimum consistent subset of simple graph classes. Zbl 07497553
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
Improved algorithm for the widest empty 1-corner corridor. Zbl 1202.68449
Das, Gautam K.; Mukhopadhyay, Debapriyay; Nandy, Subhas C. |
|
2009
|
Recognition of largest empty orthoconvex polygon in a point set. Zbl 1234.68444
Nandy, Subhas C.; Mukhopadhyaya, Krishnendu; Bhattacharya, Bhargab B. |
|
2010
|
Improved algorithm for minimum cost range assignment problem for linear radio networks. Zbl 1117.90026
Das, Gautam K.; Ghosh, Sasthi C.; Nandy, Subhas C. |
|
2007
|
Algorithms, architectures and information systems security. Zbl 1184.68591
|
|
2009
|
The maximum distance-\(d\) independent set problem on unit disk graphs. Zbl 1446.68119
Jena, Sangram K.; Jallu, Ramesh K.; Das, Gautam K.; Nandy, Subhas C. |
|
2018
|
Minimum spanning tree of line segments. Zbl 1509.68286
Dey, Sanjana; Jallu, Ramesh K.; Nandy, Subhas C. |
|
2018
|
The Euclidean \(k\)-supplier problem in \(\mathbb R^2\). Zbl 1403.90468
Basappa, Manjanna; Jallu, Ramesh K.; Das, Gautam K.; Nandy, Subhas C. |
|
2017
|
Translating a convex polyhedron over monotone polyhedra. Zbl 1061.68161
Asano, Tetsuo; Hernández-Barrera, Antonio; Nandy, Subhas C. |
|
2002
|
A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface. Zbl 1116.68646
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2004
|
Optimal algorithm for a special point-labeling problem. Zbl 1078.68830
Roy, Sasanka; Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2002
|
Weighted broadcast in linear radio networks. Zbl 1186.68017
Das, Gautam K.; Nandy, Subhas C. |
|
2008
|
Rectilinear path problems in restricted memory setup. Zbl 1432.68487
Bhattacharya, Binay K.; De, Minati; Maheswari, Anil; Nandy, Subhas C.; Roy, Sasanka |
|
2015
|
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\). Zbl 1333.68252
Bhattacharya, Binay K.; Nandy, Subhas C.; Roy, Sasanka |
|
2016
|
Prune-and-search with limited workspace. Zbl 1435.90154
De, Minati; Nandy, Subhas C.; Roy, Sasanka |
|
2015
|
Minimum consistent subset of simple graph classes. Zbl 1516.68059
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2023
|
Shortest monotone descent path problem in polyhedral terrain. Zbl 1118.68711
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2005
|
Color-spanning localized query. Zbl 1497.68513
Acharyya, Ankush; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
Acrophobic guard watchtower problem. Zbl 1533.65265
Seth, Ritesh; Maheshwari, Anil; Nandy, Subhas C. |
|
2023
|
Optimal covering and hitting of line segments by two axis-parallel squares. Zbl 1434.68616
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2017
|
Minimum width color spanning annulus. Zbl 1390.68700
Acharyya, Ankush; Nandy, Subhas C.; Roy, Sasanka |
|
2016
|
Minimum consistent subset of simple graph classes. Zbl 1516.68059
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2023
|
Acrophobic guard watchtower problem. Zbl 1533.65265
Seth, Ritesh; Maheshwari, Anil; Nandy, Subhas C. |
|
2023
|
Minimum consistent subset problem for trees. Zbl 1497.68376
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
On the geometric red-blue set cover problem. Zbl 07405957
Madireddy, Raghunath Reddy; Nandy, Subhas C.; Pandit, Supantha |
|
2021
|
Minimum consistent subset of simple graph classes. Zbl 07497553
Dey, Sanjana; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
Color-spanning localized query. Zbl 1497.68513
Acharyya, Ankush; Maheshwari, Anil; Nandy, Subhas C. |
|
2021
|
Range assignment of base-stations maximizing coverage area without interference. Zbl 1436.68375
Acharyya, Ankush; De, Minati; Nandy, Subhas C.; Roy, Bodhayan |
|
2020
|
Color spanning objects: algorithms and hardness results. Zbl 1437.68181
Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. |
|
2020
|
Variations of largest rectangle recognition amidst a bichromatic point set. Zbl 1453.68198
Acharyya, Ankush; De, Minati; Nandy, Subhas C.; Pandit, Supantha |
|
2020
|
Discriminating codes in geometric setups. Zbl 07765382
Dey, Sanjana; Foucaud, Florent; Nandy, Subhas C.; Sen, Arunabha |
|
2020
|
Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares”. Zbl 1435.68352
Sadhu, Sanjib; He, Xiaozhou; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2020
|
Covering segments with unit squares. Zbl 1468.68256
Acharyya, Ankush; Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2019
|
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Zbl 1435.68353
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2019
|
Two-center of the convex hull of a point set: dynamic model, and restricted streaming model. Zbl 1414.68135
Sadhu, Sanjib; Roy, Sasanka; Nandi, Soumen; Maheshwari, Anil; Nandy, Subhas C. |
|
2019
|
Partial enclosure range searching. Zbl 1458.68263
Bint, Gregory; Maheshwari, Anil; Smid, Michiel; Nandy, Subhas C. |
|
2019
|
Minimum width color spanning annulus. Zbl 1390.68701
Acharyya, Ankush; Nandy, Subhas C.; Roy, Sasanka |
|
2018
|
Geometric path problems with violations. Zbl 1383.68093
Maheshwari, Anil; Nandy, Subhas C.; Pattanayak, Drimit; Roy, Sasanka; Smid, Michiel |
|
2018
|
Guarding polyhedral terrain by \(k\)-watchtowers. Zbl 1446.68174
Tripathi, Nitesh; Pal, Manjish; De, Minati; Das, Gautam; Nandy, Subhas C. |
|
2018
|
The maximum distance-\(d\) independent set problem on unit disk graphs. Zbl 1446.68119
Jena, Sangram K.; Jallu, Ramesh K.; Das, Gautam K.; Nandy, Subhas C. |
|
2018
|
Minimum spanning tree of line segments. Zbl 1509.68286
Dey, Sanjana; Jallu, Ramesh K.; Nandy, Subhas C. |
|
2018
|
Contact CR-warped product submanifolds of \((\operatorname{LCS})_n\)-manifolds. Zbl 1374.53055
Hui, S. K.; Atçeken, M.; Nandy, S. |
|
2017
|
Faster approximation for maximum independent set on unit disk graph. Zbl 1414.68147
Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2017
|
Covering segments with unit squares. Zbl 1470.68230
Acharyya, Ankush; Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka |
|
2017
|
The Euclidean \(k\)-supplier problem in \(\mathbb R^2\). Zbl 1403.90468
Basappa, Manjanna; Jallu, Ramesh K.; Das, Gautam K.; Nandy, Subhas C. |
|
2017
|
Optimal covering and hitting of line segments by two axis-parallel squares. Zbl 1434.68616
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita |
|
2017
|
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\). Zbl 1333.68252
Bhattacharya, Binay K.; Nandy, Subhas C.; Roy, Sasanka |
|
2016
|
Minimum width color spanning annulus. Zbl 1390.68700
Acharyya, Ankush; Nandy, Subhas C.; Roy, Sasanka |
|
2016
|
Approximation algorithms for maximum independent set of a unit disk graph. Zbl 1317.68272
Das, Gautam K.; De, Minati; Kolay, Sudeshna; Nandy, Subhas C.; Sur-Kolay, Susmita |
|
2015
|
Minimum dominating set problem for unit disks revisited. Zbl 1344.68280
Carmi, Paz; Das, Gautam K.; Jallu, Ramesh K.; Nandy, Subhas C.; Prasad, Prajwal R.; Stein, Yael |
|
2015
|
An optimal algorithm for plane matchings in multipartite geometric graphs. Zbl 1444.68273
Biniaz, Ahmad; Maheshwari, Anil; Nandy, Subhas C.; Smid, Michiel |
|
2015
|
Rectilinear path problems in restricted memory setup. Zbl 1432.68487
Bhattacharya, Binay K.; De, Minati; Maheswari, Anil; Nandy, Subhas C.; Roy, Sasanka |
|
2015
|
Prune-and-search with limited workspace. Zbl 1435.90154
De, Minati; Nandy, Subhas C.; Roy, Sasanka |
|
2015
|
Some variations on constrained minimum enclosing circle problem. Zbl 1288.90078
Karmakar, Arindam; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Binay K. |
|
2013
|
Approximation algorithms for a variant of discrete piercing set problem for unit disks. Zbl 1318.68182
De, Minati; Das, Gautam K.; Carmi, Paz; Nandy, Subhas C. |
|
2013
|
New variations of the maximum coverage facility location problem. Zbl 1292.90177
Bhattacharya, Bhaswar B.; Nandy, Subhas C. |
|
2013
|
An in-place min-max priority search tree. Zbl 1257.68058
De, Minati; Maheshwari, Anil; Nandy, Subhas C.; Smid, Michiel |
|
2013
|
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Zbl 1290.52002
Khan, Arindam; Pal, Sudebkumar P.; Aanjaneya, Mridul; Bishnu, Arijit; Nandy, Subhas C. |
|
2013
|
On the number of shortest descending paths on the surface of a convex terrain. Zbl 1217.90147
Ahmed, Mustaq; Maheshwari, Anil; Nandy, Subhas C.; Roy, Sasanka |
|
2011
|
Homogeneous 2-hop broadcast in 2D. Zbl 1173.90448
Das, Gautam K.; Das, Sandip; Nandy, Subhas C. |
|
2010
|
Separating multi-color points on a plane with fewest axis-parallel lines. Zbl 1204.68245
Majumder, Subhashis; Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2010
|
Recognition of largest empty orthoconvex polygon in a point set. Zbl 1234.68444
Nandy, Subhas C.; Mukhopadhyaya, Krishnendu; Bhattacharya, Bhargab B. |
|
2010
|
Smallest color-spanning object revisited. Zbl 1178.65020
Das, Sandip; Goswami, Partha P.; Nandy, Subhas C. |
|
2009
|
Constrained minimum enclosing circle with center on a query line segment. Zbl 1175.65033
Roy, Sasanka; Karmakar, Arindam; Das, Sandip; Nandy, Subhas C. |
|
2009
|
Algorithms for computing diffuse reflection paths in polygons. Zbl 1211.68467
Ghosh, Subir Kumar; Goswami, Partha Pratim; Maheshwari, Anil; Nandy, Subhas Chandra; Pal, Sudebkumar Prasant; Sarvattomananda, Swami |
|
2009
|
Improved algorithm for the widest empty 1-corner corridor. Zbl 1202.68449
Das, Gautam K.; Mukhopadhyay, Debapriyay; Nandy, Subhas C. |
|
2009
|
Algorithms, architectures and information systems security. Zbl 1184.68591
|
|
2009
|
Variations of base-station placement problem on the boundary of a convex region. Zbl 1155.68015
Das, Gautam K.; Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2008
|
A generalization of magic squares with applications to digital halftoning. Zbl 1137.05303
Aronov, Boris; Asano, Tetsuo; Kikuchi, Yosuke; Nandy, Subhas C.; Sasahara, Shinji; Uno, Takeaki |
|
2008
|
Weighted broadcast in linear radio networks. Zbl 1186.68017
Das, Gautam K.; Nandy, Subhas C. |
|
2008
|
Shortest monotone descent path problem in polyhedral terrain. Zbl 1117.65037
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2007
|
Improved algorithm for minimum cost range assignment problem for linear radio networks. Zbl 1117.90026
Das, Gautam K.; Ghosh, Sasthi C.; Nandy, Subhas C. |
|
2007
|
Efficient algorithm for placing a given number of base stations to cover a convex region. Zbl 1178.68028
Das, Gautam K.; Das, Sandip; Nandy, Subhas C.; Sinha, Bhabani P. |
|
2006
|
Range assignment for energy efficient broadcasting in linear radio networks. Zbl 1090.90027
Das, Gautam K.; Das, Sandip; Nandy, Subhas C. |
|
2006
|
Simple algorithms for partial point set pattern matching under rigid motion. Zbl 1098.68928
Bishnu, Arijit; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2006
|
Constrained minimum enclosing circle with center on a query line segment. Zbl 1132.68797
Roy, Sasanka; Karmakar, Arindam; Das, Sandip; Nandy, Subhas C. |
|
2006
|
Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation. Zbl 1182.68331
Das, Sandip; Goswami, Partha P.; Nandy, Subhas C. |
|
2005
|
Shortest monotone descent path problem in polyhedral terrain. Zbl 1118.68711
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2005
|
Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment. Zbl 1060.65026
Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2004
|
Optimal algorithm for a special point-labeling problem. Zbl 1178.68650
Roy, Sasanka; Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2004
|
A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface. Zbl 1116.68646
Roy, Sasanka; Das, Sandip; Nandy, Subhas C. |
|
2004
|
Largest empty rectangle among a point set. Zbl 1043.65035
Chaudhuri, Jeet; Nandy, Subhas C.; Das, Sandip |
|
2003
|
On finding an empty staircase polygon of largest area (width) in a planar point-set. Zbl 1027.65027
Nandy, Subhas C.; Bhattacharya, Bhargab B. |
|
2003
|
An efficient \(k\) nearest neighbors searching algorithm for a query line. Zbl 1040.68031
Nandy, Subhas C.; Das, Sandip; Goswami, Partha P. |
|
2003
|
Shattering a set of objects in 2D. Zbl 1052.68141
Nandy, Subhas C.; Asano, Tetsuo; Harayama, Tomohiro |
|
2002
|
Translating a convex polyhedron over monotone polyhedra. Zbl 1061.68161
Asano, Tetsuo; Hernández-Barrera, Antonio; Nandy, Subhas C. |
|
2002
|
Optimal algorithm for a special point-labeling problem. Zbl 1078.68830
Roy, Sasanka; Goswami, Partha P.; Das, Sandip; Nandy, Subhas C. |
|
2002
|
Dynamically maintaining the widest \(k\)-dense corridor. Zbl 0974.68218
Nandy, S. C.; Harayama, T.; Asano, T. |
|
2001
|
Maximal empty coboids among points and blocks. Zbl 0939.68145
Nandy, S. C.; Bhattacharya, B. B. |
|
1998
|
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Zbl 0939.68504
Nandy, S. C.; Bhattacharya, B. B. |
|
1995
|
Location of the largest empty rectangle among arbitrary obstacles. Zbl 1044.68864
Nandy, Subhas C.; Sinha, Arani; Bhattacharya, Bhargab B. |
|
1994
|
Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design. Zbl 0733.68090
Nandy, Subhas C.; Bhattacharya, Bhargab B.; Ray, Sibabrata |
|
1990
|