| 2026 | COCOON | Algorithms and Bounds for Path Covers of Tree-Structured Graphs. | Madhura Dutta, Florent Foucaud, Subhas C. Nandy |
| 2022 | FAW | Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. | Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit |
| 2022 | IWCIA | On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra. | Nilanjana Karmakar, Arindam Biswas, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2021 | FCT | Minimum Consistent Subset Problem for Trees. | Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
| 2021 | WALCOM | On the Geometric Red-Blue Set Cover Problem. | Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit |
| 2020 | ISAAC | Discriminating Codes in Geometric Setups. | Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen |
| 2018 | COCOON | Minimum Spanning Tree of Line Segments. | Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy |
| 2018 | FAW | The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. | Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy |
| 2018 | FAW | Guarding Polyhedral Terrain by k-Watchtowers. | Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy |
| 2017 | COCOON | Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. | Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy |
| 2017 | ICCSA | Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. | Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy |
| 2017 | WADS | Covering Segments with Unit Squares. | Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy |
| 2016 | Algosensors | The Euclidean k-Supplier Problem in. | Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy |
| 2016 | COCOON | Minimum Width Color Spanning Annulus. | Ankush Acharyya, Subhas C. Nandy, Sasanka Roy |
| 2015 | WADS | An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. | Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid |
| 2012 | AAIM | In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. | Minati De, Subhas C. Nandy, Sasanka Roy |
| 2012 | COMSNETS | Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. | Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy |
| 2012 | ICDCN | Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). | Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy |
| 2010 | COCOA | Some Variations on Constrained Minimum Enclosing Circle Problem. | Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya |
| 2010 | WALCOM | A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2009 | WALCOM | Improved Algorithm for a Widest 1-Corner Corridor. | Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy |
| 2009 | WALCOM | Algorithms for Computing Diffuse Reflection Paths in Polygons. | Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda |
| 2007 | WALCOM | Base Station Placement Problem on the Boundary of a Convex Region. | Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2006 | AAIM | Weighted Broadcast in Linear Radio Networks. | Gautam K. Das, Subhas C. Nandy |
| 2006 | ICCSA | Homogeneous 2-Hops Broadcast in 2D. | Gautam K. Das, Sandip Das, Subhas C. Nandy |
| 2006 | MFCS | Constrained Minimum Enclosing Circle with Center on a Query Line Segment. | Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy |
| 2005 | FPL | Fast FPGA Placement using Space-filling Curve. | Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy |
| 2005 | ICCSA | Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. | Sandip Das, Partha P. Goswami, Subhas C. Nandy |
| 2005 | VLSID | Hot Spots and Zones in a Chip: A Geometrician's View. | Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty |
| 2005 | STACS | Shortest Monotone Descent Path Problem in Polyhedral Terrain. | Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2004 | GLOBECOM | An efficient heuristic algorithm for 2D h-hops range assignment problem. | Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy |
| 2004 | HiPC | Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. | Gautam K. Das, Sandip Das, Subhas C. Nandy |
| 2004 | ICCSA | A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. | Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2004 | ISAAC | A Generalization of Magic Squares with Applications to Digital Halftoning. | Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno |
| 2003 | CIAC | An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2001 | ISCAS | Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. | Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy |
| 2000 | CIAC | Dynamically Maintaining the Widest k -Dense Corridor. | Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano |
| 2000 | COCOON | An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. | Subhas C. Nandy |
| 1999 | COCOON | Generalized Shooter Location Problem. | Jeet Chaudhuri, Subhas C. Nandy |
| 1999 | VLSID | High Performance MCM Routing: A New Approach. | Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 1998 | VLSID | Partitioning VLSI Floorplans by Staircase Channels for Global Routing. | Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 1996 | VLSID | Geometric bipartitioning problem and its applications to VLSI. | Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya |