- M. De, A. Maheshwari, S. C. Nandy, M. H. M. Smid,
*An in-place min-max priority search tree*,**Comput. Geom.**, vol. 46(3), pp. 310-327, 2013. - J. Augustine, S. Das, A. Maheshwari, S. C. Nandy, S. Roy, S. Sarvattomananda,
*Localized geometric query problems*,**Comput. Geom.**, vol. 46(3), pp. 340-357, 2013. - A. Khan, S. P. Pal, M. Aanjaneya, A. Bishnu, S. C. Nandy,
*Diffuse reflection diameter and radius for convex-quadrilateralizable polygons*,**Discrete Applied Mathematics**, vol. 161(10-11), pp. 1496-1505, 2013. - B. B. Bhattacharya, S. C. Nandy,
*New variations of the maximum coverage facility location problem*,**European Journal of Operational Research**, vol. 224(3), pp. 477-485, 2013. - A. Karmakar, S. Das, S. C. Nandy, B. K. Bhattacharya,
*Some variations on constrained minimum enclosing circle problem*,**J. Comb. Optim.**, vol. 25(2), pp. 176-190, 2013. - S. K. Ghosh, P. P. Goswami, A. Maheshwari, S. C. Nandy, S. P. Pal, S. Sarvattomananda,
*Algorithms for computing diffuse reflection paths in polygons*,**The Visual Computer**, vol. 28(12), pp. 1229-1237, 2012. - D. Mondal, A. Kumar, A. Bishnu, K. Mukhopadhyaya, S. C. Nandy,
*Measuring the Quality of Surveillance in a Wireless Sensor Network*,**Int. J. Found. Comput. Sci.**, vol. 22(4), pp. 983-998, 2011. - M. Ahmed, A. Maheshwari, S. C. Nandy, S. Roy,
*On the number of shortest descending paths on the surface of a convex terrain*,**J. Discrete Algorithms**, vol. 9(2), pp. 182-189, 2011. - G. K. Das, S. Das, S. C. Nandy,
*Homogeneous 2-hop broadcast in 2D*,**Comput. Geom.**, vol. 43(2), pp. 182-190, 2010 - S. Majumder, S. C. Nandy, B. B. Bhattacharya,
*Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines*,**Fundam. Inform.**, vol. 99(3), pp. 315-324, 2010. - S. C. Nandy, K. Mukhopadhyaya, B. B. Bhattacharya,
*Recognition of largest empty orthoconvex polygon in a point set**, Inf. Process. Lett.*, vol. 110(17), pp. 746-752, 2010. - S. Roy, A. Karmakar, S. Das, S. C. Nandy,
*Constrained minimum enclosing circle with center on a query line segment*,**Comput. Geom.**, vol. 42(6-7), pp. 632-638, 2009. - S. Das, P. P. Goswami, S. C. Nandy,
*Smallest Color-Spanning Object Revisited*,**Int. J. Comput. Geometry Appl.**, vol. 19(5), pp. 457-478, 2009. - S. Roy, S. Bhattacharjee, S. Das, S. C. Nandy,
*A new fast heuristic for labeling points*,**Inf. Process. Lett.**, vol. 109(10), pp. 478-484, 2009. -
G. K. Das, D. Mukhopadhyay, S. C. Nandy,
*Improved algorithm for the widest empty 1-corner corridor**,***Inf. Process. Lett.**, vol. 109(18), pp. 1060-1065, 2009. -
P. Banerjee, S. Sur-Kolay, A. Bishnu, S. Das, S. C. Nandy, S. Bhattacharjee,
*FPGA placement using space-filling curves: Theory meets practice*,**ACM Trans. Embedded Comput. Syst.**, vol. 9(2), 2009. -
G. K. Das, S. Roy, S. Das, S. C. Nandy,
*Variations of Base-Station Placement Problem on the Boundary of a Convex Region*,**Int. J. Found. Comput. Sci.**, vol. 19(2), pp. 405-427,2008. -
G. K. Das, S. C. Nandy,
*Weighted broadcast in linear radio networks*,**Inf. Process. Lett.**vol. 106(4), pp. 136-143,2008. -
B. Aronov, T. Asano, Y. Kikuchi, S. C. Nandy, S. Sasahara and T. Uno,
*A Generalization of Magic Squares with Applications to Digital Halftoning*,**Theory Comput. Syst.**, vol. 42(2): pp. 143-156, 2008. - G. K. Das, S. C. Ghosh and S. C. Nandy,
*Improved algorithm for minimum cost range assignment problem for linear radio networks*,**Int. Journal of Foundations of Computer Science,**vol. 18, pp. 619-636, 2007. - S. Roy, S. Das and S. C. Nandy,
*Shortest monotone descent path problem in polyhedral terrain*,**Computational Geometry - Theory and Applications**, vol. 37, pp. 115-133, 2007. - P. P. Goswami, S. Das and S. C. Nandy,
*Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set*,**Information Processing Letters**, vol. 102, pp. 163-168, 2007. - A. Bishnu, S. Das, S. C. Nandy and B. B. Bhattacharya,
*Simple algorithm for point set pattern matching under rigid motion*,**Pattern Recognition**, vol 39, pp. 1662-1671, 2006. - G. K. Das, S. Das, S. C. Nandy, B. P. Sinha,
*Efficient algorithm for placing a given number of base stations to cover a convex region*,**Journal on Parallel and Distributed Computing**vol. 66, pp. 1353-1358, 2006. - G. K. Das, S. Das and S. C. Nandy,
*Range assignment for energy efficient broadcasting in linear radio networks*,**Theoretical Computer Science**, vol 352(1-3), pp. 332-341, 2006. - P. P. Goswami, S. Das and S. C. Nandy,
*Smallest k-point enclosing rectangle and square of arbitrary orientation*,**Information Processing Letters**, vol 94(6), pp. 259-266, 2005. - S. Majumder, S. C. Nandy and B. B. Bhattacharya,
*On finding a staircase channel with minimum crossing nets in a VLSI floorplan*,**Journal of Circuits, Systems, and Computers (JCSC)**, vol 13(5), pp. 1019-1038, 2004. - P. P. Goswami, S. Das and S. C. Nandy,
*Triangular Range Counting Query in 2D and its Application in Finding k Nearest Neighbors of a Line Segment*,**Computational Geometry: Theory and Applications**, vol 29(3), pp. 163-175, 2004. - S. Roy, P. P. Goswami, S. Das and S. C. Nandy,
*Optimal Algorithm for a Special Point-labeling Problem*,**Information Processing Letters**, vol. 89, pp. 91-98, 2004. - S. C. Nandy and B. B. Bhattacharya,
*On Finding an Empty Staircase Polygon of Largest Area (Width) in a Planar Point-set*,**Computational Geometry - Theory and Applications**, vol. 26, pp. 143-171, 2003. - J. Chaudhouri, S. C. Nandy and S. Das,
*Largest empty rectangle among a point set*,**Journal of Algorithms**, vol. 54, pp. 54-78, 2003. - S. C. Nandy, S. Das and P. P. Goswami,
*An efficient k nearest neighbors searching algorithm for a query line***Theoretical Computer Science**, vol. 299 (1-3), pp. 273-288, 2003. - T. Asano, A. Hernandez-Barrera, and S. C. Nandy
*The Minkowski sun of a convex polygon and a polygonal terrain*,**Computational Geometry : Theory and Applications**, vol. 23(3), pp. 257-269, 2002. - S. C. Nandy, T. Asano and T. Harayama,
*Shattering a set of objects in 2D*, in**Discrete Applied Mathematics**, vol 122, pp. 183-194, October 2002. - P. S. Dasgupta, A. K. Sen, S. C. Nandy, B. B. Bhattacharya,
*Searching Networks with Unrestricted Arc Costs*, in**IEEE Transaction on Systems, Man and Cybernatics: Part A**, vol. 31, pp. 497-507, November 2001. - S. C. Nandy, T. Harayama and T. Asano,
*Dynamically Maintaining the Widest k-dense Corridor*,**Theoretical Computer Science**, vol. 255,pp. 627-639, 2001. - P. S. Dasgupta, P. Pan, S. C. Nandy and B. B. Bhattacharya,
*Geometric bipartitioning problems with applications in VLSI design*, accepted in**ACM Transaction on Design Automation of Electronics Systems (TODAES)**, 2000. - S. C. Nandy, B. B. Bhattacharya and A. Hernandez Barrera,
*Safety zone problem*,**Journal of Algorithms**, vol. 37, pp. 538-569, 2000. - A. Chatterjee, S. S. Sarkar, S. C. Nandy,
*Petrological mixing - a regression approach*,**Calcutta Statistical association Bulletin**, vol. 50, Nos. 197-198, pp. 79-94, 2000. - P. Mitra and S. C. Nandy
*Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles*,**Journal of Algorithms**, vol. 28, pp. 315-338, 1998. - S. C. Nandy and B. B. Bhattacharya
*Largest empty cuboid among points and blocks*,**Computers and Mathematics with applications**, vol. 36, No. 3, pp. 11-20, 1998. - S. C. Nandy, G. N. Nandakumar and B. B. Bhattacharya
*Efficient Algorithms for Single and Two-layer Linear Placement of Parallel Graphs*,**Computers and Mathematics with applications**, vol. 34, No. 12, pp. 121-135, 1997 - S. C. Nandy and B. B. Bhattacharya
*A Unified Algorithm for Finding Maximum and Minimum Point Enclosing Rectangles and Cuboids*,**Int. J. on Computers and Mathematics with applications**, vol. 29, no. 8, pp. 45-61, 1995. - S. C. Nandy, B. B. Bhattacharya and S. Ray
*Dynamic Identification of All Maximal Empty Rectangles in VLSI Layout Design using Corner Stitching*,**Journal of Information Technology**, vol. 2, no. 1, pp. 44-51, 1991. - T. Krishnan and S. C. Nandy
*Efficiency of Discriminant Analysis when Initial Samples are Classified Stochastically*,**Pattern Recognition**, vol.23, pp. 529-537, 1990. - T. Krishnan and S. C. Nandy
*Efficiency of Logistic-Normal Stochastic Supervisor*,**Pattern Recognition**, vol.23, pp. 529-537, 1990. - A.K.Chatterjee, S.S.Sarkar, S. C. Nandy and A.K.Saha,
*Cluster Analysis Revisited : A Case Study from Bihar MicaBelt Granites, Eastern India*, in**Indian Minerals**, vol.43,no.2, pp.128-135. - A.K.Chatterjee, S.S.Sarkar, S. C. Nandy and A.K.Saha,
*A Quadratic Programming Approach for Solving Petrological Mixing Model*, in**Indian Journal of Earth Science**, vol.16, no.2, pp. 104-118, 1989. - S.S.Sarkar, A.Chatterjee, S. C. Nandy and A.K.Saha,
*Classification of the granites of Bihar Mica Belt, EasternIndia using Stepwise Multigroup Discriminant Analysis & ClusterAnalysis*, in**Indian Journal of Earth science**, vol. 15,1988. - T. Krishnan and S. C. Nandy
*Discriminant Analysis with a Stochastic Supervisor*,**Pattern Recognition**, vol.20, no.4, pp. 379-384, 1987.

- M. De, S. C. Nandy, S. Roy,
*Minimum Enclosing Circle with Few Extra Variables*,FSTTCS 2012 , 510-521 - M. De, S. C. Nandy, S. Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338
- D. Dash, A. Bishnu, A. Gupta, S. C. Nandy: Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS 2012: 1-10
- D. Dash, A. Bishnu, A. Gupta, S. C. Nandy: Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN 2012: 214-217
- M. De, G. K. Das, S. C. Nandy: Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011
- M. De, A. Maheshwari, S. C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011
- M. De, S. C. Nandy: Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011
- G. K. Das, A. Mukhopadhyay, S. C. Nandy, S. Patil, S. V. Rao: Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210
- B. B. Bhattacharya, S. C. Nandy: New variations of the reverse facility location problem. CCCG 2010: 241-244
- S. Sadhu, A. Bishnu, S. C. Nandy, P. P. Goswami: Cluster connecting problem inside a polygon. CCCG 2010: 265-268
- A. Karmakar, S. Das, S. C. Nandy, B. K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368
- A. Bishnu, S. Das, Subhas C. Nandy, B. B. Bhattacharya: A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM 2010: 102-112
- S. K. Ghosh, P. P. Goswami, A. Maheshwari, S. C. Nandy, S. P. Pal, Swami Sarvattomananda: Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58
- G. K. Das, D. Mukhopadhyay, S. C. Nandy: Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92
- S. C. Nandy, K. Mukhopadhyaya, B. B. Bhattacharya: Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 2008
- G. K. Das, S. Roy, S. Das, S. C. Nandy: Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152
- G. K. Das, S. C. Nandy: Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353
- G. K. Das, S. Das, S. C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
- S. Roy, A. Karmakar, S. Das, S. C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
- G. K. Das, S. Das, S. C. Nandy and B. P. Sinha,
*Placing a Given Number of Base Stations to Cover a Convex Region*,**Proc. Int. Workshop. on Distributed Computing (IWDC)**, LNCS 3741, pp. 57-62, 2005. - S. Roy, S. Bhattacharjee, S. Das and S. C. Nandy,
*A Fast Algorithm for Point Labeling Problem*,**Proc. 17th Canadian Conference on Computational Geometry**, pp. 155-158, 2005. - P. Banerjee, S. Bhattacharjee, S. Sur-Kolay, S. Das and
S. C. Nandy,
*Fast FPGA Placement using Space-filling Curve*,**Proc. of the 2005 Int. Conf. on Field Programmable Logic and Applications (FPL)**, pp. 415-420, 2005. - S. Das, P. P. Goswami and S. C. Nandy,
*Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle*, Proc. Computational Geometry and Applications (in conjunction with**The 2005 Int. Conf. on Computational Science and its Applications**), LNCS 3481, pp. 827-837, 2005. - S. Roy, S. Das and S. C. Nandy,
*Shortest Monotone Descent Path Problem in Polyhedral Terrain*,**Proc. 22**, pp. 281-292, 2005.^{nd}Symp. on Theoretical Aspects of Computer Science (STACS) - S. Majumder, S. Sur-Kolay, S. C. Nandy, B. B. Bhattacharya and B. Chakraborty,
*Hot Spots and Zones in a Chip: A Geometrician's View*,**Proc. Int. Conf. on VLSI Design**, pp. 691-696, 2005. - B. Aronov, T. Asano, Y. Kikuchi, S. C. Nandy, S. Sasahara and T. Uno,
*A Generalization of Magic Squares with Applications to Digital Halftoning*,**Proc. 15**, pp. 89-100, 2004.^{th}Int. Symp. on Algorithms and Computation (ISAAC) - G. K. Das, S. C. Ghosh and S. C. Nandy,
*Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks*,**Proc. Int. Workshop. on Distributed Computing (IWDC)**, LNCS 3326, pp. 412-423, 2004. - G. K. Das, S. Das and S. C. Nandy,
*Efficient Algorithms for Energy Efficient Broadcasting in Linear Radio Networks*,**Proc. Int. Conf. on High Performence Computing (HiPC)**, LNCS 3296, pp. 420-429, 2004. - G. K. Das, S. C. Ghosh and S. C. Nandy,
*An Efficient Heuristic Algorithm for 2D h-Hops Range Assignment Problem*,**Proc. IEEE Global Telecommunication Conference (GLOBECOM)**, vol. 3, pp. 1051-1055, 2004. - S. Das, P. P. Goswami and S. C. Nandy,
*Smallest k point enclosing rectangle of arbitrary orientation***Proc. 16th Canadian Conference on Computational Geometry**pp. 116-119, 2004. - S. Roy, S. Das and S. C. Nandy,
*A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface*,**Proc. Computational Geometry and Applications**(in conjunction with**The 2004 Int. Conf. on Computational Science and its Applications**), LNCS 3045, pp. 42-52, 2004. - A. Bishnu, S. Das, S. C. Nandy and B. B. Bhattacharya,
*An Improved Algorithm for Point Set Pattern Matching under Rigid Motion*, accepted in**5th. Italian Conference on Algorithm and Complexity**, 28-31 May, 2003. - P. P. Goswami, S. Das and S. C. Nandy,
*Simplex range searching and k nearest neighbors of a line segment in 2D*,**Scandinavian Workshop on Algorithmic Theory**, SWAT-2002, LNCS 2369, pp. 69-79, 2002. - S. Roy, P. P. Goswami, S. Das and S. C. Nandy,
*Optimal Algorithm for a Special Point-labeling Problem*,**Scandinavian Workshop on Algorithmic Theory**, SWAT-2002, LNCS 2369, pp. 110-120, 2002. - S. Majumder, S. Sur-Kolay, S. C. Nandy and B. B. Bhattacharya,
*Area-(Number-) balanced hierarchy of staircase channels with minimum crossing nets*,**Proc. International Symp. on Circuits and Systems (ISCAS 2001**, May 6-9, 2001, Sydney, Australia, pp. 395-398. - S. C. Nandy,
*An efficient k nearest neighbor searching algorithm for a query line*, in Proc.**6th Annual International Conference, on Computing and Combinatorics**(COCOON 2000), LNCS 1858, pp. 281-290, Sydney, Australia, July 2000. - S. C. Nandy, T. Harayama and T. Asano,
*Dynamically Maintaining the Widest k-dense Corridor*,**Proc. Italian Conference on Algorithms and Computation**, Lecture Notes in Computer Science, LNCS-1767, Springer, pp. 187-198, Italy, 2000. - J. Chaudhuri and S. C. Nandy,
*Largest empty rectangle among a point set*,**Proc. 19th. Int. Conf. on Foundation of Software Technology and Theoretical Computer Science**, LNCS 1738, pp. 34-46, India, December 1999. - J. Chaudhuri and S. C. Nandy,
*Generalized shooter location problem*,**Proc. 5th. Annual Int. Conf. on Computing and Combinatorics**, Lecture Notes in Computer Science, LNCS-1627, Springer, pp. 389-399, Japan, 1999. - S. C. Nandy,
*Shattering a set of objects in 2D*,**Proc. Canadian Conf. on Computational Geometry**, pp. 107-110, British Columbia, Canada, 1999. - S. Das, S. C. Nandy and B. B. Bhattacharya,
*High-performence MCM routing - A new approach*,**Int. Conference in VLSI Design**, IEEE CS Press, pp. 564-569, January 1999. - P. Mahalingam, S. C. Nandy, S. Sur-Kolay, B. B. Bhattacharya,
*Topological routing of convex polygonal circuit blocks*,**Int. Workshop on VLSI Design and Test**, Aug. 1998, New Delhi. - S. Majumder, S. C. Nandy and B. B. Bhattacharya,
*Partitioning VLSI floorplans by staircase channels for global routing*,**Int. Conference in VLSI Design (IEEE)**, pp. 59-64, 1998. - P. Mitra and S. C. Nandy
*Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles*,**Proc. 16th. Conf. on Foundation of Software Technology and Theoretical Computer Science**, Lecture Notes in Computer Science (LNCS) No. 1180, pp. 76-87, Springer Verlag, December 1996. - S. C. Nandy, B. B. Bhattacharya and K. Mukhopadhyaya
*Shooter Location Problem*,**Proc. of the 8th Canadian Conference on Computational Geometry**, CCCG '96, Carleton University Press, pp. 93-98, August 12-15, 1996. - P. S. Dasgupta, A. K. Sen, S. C. Nandy and B. B. Bhattacharya,
*Geometric bipartitioning problem and its applications to VLSI*,**Int. Conference in VLSI Design (IEEE)**, pp. 400-405, 1996. - S. C. Nandy, A. Sinha and B. B. Bhattacharya
*Largest empty isothetic rectangle among a set of non-isothetic obstacles*, >Proc. 14th. Conf. on Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science (LNCS) No. 880, Springer Verlag, December 1994, pp. 159-170. - S. C. Nandy, D. Ghosh and B. B. Bhattacharya
*Location of largest empty staircase polygon among obstacles*, in Proceedings**4th. National Seminar on Theoretical Computer Science**, IIT Kanpur, pp. 205-229, June 1994. - S. Das, S. C. Nandy and B. B. Bhattacharya
*An improved heuristic algorithm for over-the-cell channel routing*, in Proc. (IEEE)**International Symposium on Circuits and Systems (ISCAS)**, pp. 3106-3109, Singapore, June 1991. - S. C. Nandy, B. B. Bhattacharya and S. Ray
*Efficient algorithm for identifying all maximal isothetic empty rectangles in VLSI layout design*,**Proc. 10th. Conf. on Foundation of Software Technology and Theoretical Computer Science**, Lecture Notes in Computer Science (LNCS) No. 472, Springer Verlag, December 1990, pp. 255-269.