| Channel routing in Manhattan-diagonal model S Das, B Bhattacharya Proceedings of 9th International Conference on VLSI Design, 43-48, 1996 | 74 | 1996 |
| Routing of L-shaped channels, switchboxes and staircases in manhattan-diagonal model S Das, S Sur-Kolay, BB Bhattacharya Proceedings Eleventh International Conference on VLSI Design, 65-70, 1998 | 70 | 1998 |
| 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 | 66 | 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 |
| Voronoi game on graphs S Bandyapadhyay, A Banik, S Das, H Sarkar Theoretical Computer Science 562, 270-282, 2015 | 45 | 2015 |
| Smallest color-spanning object revisited S Das, PP Goswami, SC Nandy International Journal of Computational Geometry & Applications 19 (05), 457-478, 2009 | 39 | 2009 |
| Largest empty rectangle among a point set J Chaudhuri, SC Nandy, S Das Journal of algorithms 46 (1), 54-78, 2003 | 39 | 2003 |
| Synthesis of symmetric functions for path-delay fault testability S Chakrabarti, S Das, DK Das, BB Bhattacharya IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2000 | 37 | 2000 |
| 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 | 35 | 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 | 33 | 2005 |
| Minimum-width rectangular annulus J Mukherjee, PRS Mahapatra, A Karmakar, S Das Theoretical Computer Science 508, 74-80, 2013 | 31 | 2013 |
| Optimal strategies for the one-round discrete Voronoi game on a line A Banik, BB Bhattacharya, S Das Journal of Combinatorial Optimization 26 (4), 655-669, 2013 | 30 | 2013 |
| A lower bound technique for radio k-coloring S Das, SC Ghosh, S Nandi, S Sen Discrete Mathematics 340 (5), 855-861, 2017 | 29 | 2017 |
| Some variations on constrained minimum enclosing circle problem A Karmakar, S Das, SC Nandy, BK Bhattacharya Journal of Combinatorial Optimization 25, 176-190, 2013 | 28 | 2013 |
| 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 |
| 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 | 19 | 2008 |
| Shortest monotone descent path problem in polyhedral terrain S Roy, S Das, SC Nandy Computational Geometry 37 (2), 115-133, 2007 | 19 | 2007 |
| 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 | 19 | 2004 |
| 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 | 19 | 2003 |
| Circular‐Arc Bigraphs and Its Subclasses A Basu, S Das, S Ghosh, M Sen Journal of Graph Theory 73 (4), 361-376, 2013 | 18 | 2013 |
