A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids SC Nandy, BB Bhattacharya Computers & Mathematics with Applications 29 (8), 45-61, 1995 | 74 | 1995 |

Efficient algorithm for placing a given number of base stations to cover a convex region GK Das, S Das, SC Nandy, BP Sinha Journal of Parallel and Distributed Computing 66 (11), 1353-1358, 2006 | 68 | 2006 |

Fingerprint minutiae matching using scoring techniques T Acharya, BB Bhattacharya, A Biswas, P Bhowmick, A Bishnu, S Das, ... US Patent 7,359,532, 2008 | 65 | 2008 |

Smallest color-spanning object revisited S Das, PP Goswami, SC Nandy International Journal of Computational Geometry & Applications 19 (05), 457-478, 2009 | 40 | 2009 |

Largest empty rectangle among a point set J Chaudhuri, SC Nandy, S Das Journal of algorithms 46 (1), 54-78, 2003 | 40 | 2003 |

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks D Dash, A Bishnu, A Gupta, SC Nandy Wireless networks 19, 857-870, 2013 | 37 | 2013 |

Simple algorithms for partial point set pattern matching under rigid motion A Bishnu, S Das, SC Nandy, BB Bhattacharya Pattern Recognition 39 (9), 1662-1671, 2006 | 36 | 2006 |

Smallest k-point enclosing rectangle and square of arbitrary orientation S Das, PP Goswami, SC Nandy Information Processing Letters 94 (6), 259-266, 2005 | 34 | 2005 |

Some variations on constrained minimum enclosing circle problem A Karmakar, S Das, SC Nandy, BK Bhattacharya Journal of Combinatorial Optimization 25, 176-190, 2013 | 30 | 2013 |

Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design SC Nandy, BB Bhattacharya, S Ray Foundations of Software Technology and Theoretical Computer Science: Tenth …, 1990 | 27 | 1990 |

Approximation algorithms for maximum independent set of a unit disk graph GK Das, M De, S Kolay, SC Nandy, S Sur-Kolay Information Processing Letters 115 (3), 439-446, 2015 | 25 | 2015 |

New variations of the maximum coverage facility location problem BB Bhattacharya, SC Nandy European Journal of Operational Research 224 (3), 477-485, 2013 | 24 | 2013 |

Maximal empty cuboids among points and blocks SC Nandy, BB Bhattacharya Computers & Mathematics with Applications 36 (3), 11-20, 1998 | 24 | 1998 |

Fast FPGA placement using space-filling curve P Banerjee, S Bhattacharjee, S Sur-Kolay, S Das, SC Nandy International Conference on Field Programmable Logic and Applications, 2005 …, 2005 | 23 | 2005 |

Efficiency of discriminant analysis when initial samples are classified stochastically T Krishnan, SC Nandy Pattern recognition 23 (5), 529-537, 1990 | 23 | 1990 |

An efficient k nearest neighbors searching algorithm for a query line SC Nandy, S Das, PP Goswami Theoretical computer science 299 (1-3), 273-288, 2003 | 22 | 2003 |

Location of the largest empty rectangle among arbitrary obstacles SC Nandy, A Sinha, BB Bhattacharya Foundation of Software Technology and Theoretical Computer Science: 14th …, 1994 | 22 | 1994 |

Approximation algorithms for a variant of discrete piercing set problem for unit disks M De, GK Das, P Carmi, SC Nandy International Journal of Computational Geometry & Applications 23 (06), 461-477, 2013 | 20 | 2013 |

Variations of base-station placement problem on the boundary of a convex region GK Das, S Roy, S Das, SC Nandy International Journal of Foundations of Computer Science 19 (02), 405-427, 2008 | 20 | 2008 |

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment PP Goswami, S Das, SC Nandy Computational Geometry 29 (3), 163-175, 2004 | 20 | 2004 |