Work Experience :

• Associate Professor in Indian Statistical Institute, Kolkata, from June 1999.
  
• Computer Systems Engineer (an Associate Professor equivalent position) in Indian Statistical Institute, Kolkata, from June 1993.
  
• Programmer (an Assistant Professor equivalent position) in Indian Statistical Institute, Kolkata, from December 1988.
  
• Data Processing Technician in Indian Statistical Institute, Kolkata, from August 20, 1986 to November 1988.
  
• Statistician in Indian Tea Association from May 1986 to August 18, 1986.
  
• Trainee Programmer in Indian Statistical Institute, Kolkata, from Nov. 1985 to April 1986.
  

Research Experience :

• Discrete and Computational Geometry
  
• Graph Algorithms
  
• VLSI Design
  
• Data Structure & Analysis of Algorithms
  

Research guidance:

• Application of computational geometry in visibility graph recognition and nearest neighbor problems, to be submitted soon in Calcutta University.
  
• Facility location problems - algorithms and applications, in preparation, and will be submitted in Indian Statistical Institute.
  

• 12 students of ISI M.Tech.(CS) worked of various problems on geometric and VLSI physical design Algorithms.
  

Visit in Abroad :

• Attended 8th Canadian Conference on Computational Geometry, Calrelon University, Ottawa, Canada, August 12-15, 1996.
  
• Served as an Associate in the School of Information Sciences, Japan Adavanced Institute of Science and Technology, Ishikawa, Japan from August 3, 1998 to August 24, 1999.
  
• Attended 5th Annual International Conference, on Computing and Combinatorics (COCOON 1999), July 27-29, Tokyo, Japan.
  
• Attended 11th. Canadian Conference on Computational Geometry, University of British Columbia, Canada, August 15-18, 1999.
  
• Served as a Research Associate in Dept. of Computer Science, City University of Hongkong, Kowloon, Hongkong, from May 21, 2000 to August 21, 2000.
  
• Attended 6th Annual International Conference, on Computing and Combinatorics (COCOON 2000), Sydney, Australia July 26-28, 2000.
  
• Served as a visiting professor in the School of Information Sciences, Japan Adavanced Institute of Science and Technology, Ishikawa, Japan from February 25, 2003 to March 10, 2003.
  

Recent Event:

TIFR-CRCE Workshop on Introduction to Geometric Algorithms

List of Publications:

Journals:

1. S. C. Nandy and B. B. Bhattacharya, On Finding an Empty Staircase Polygon of Largest Area (Width)in a Planar Point-set, accepted in Computational Geometry - Theory and Applications, 2003.
2. J. Chaudhouri, S. C. Nandy and S. Das, Largest empty rectangle among a point set, Journal of Algorithms, vol. 54, pp. 54-78, 2003.
3. 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.
4. 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.
5. 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.
6. 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.
7. S. C. Nandy, T. Harayama and T. Asano, Dynamically Maintaining the Widest k-dense Corridor, Theoretical Computer Science, vol. 255,pp. 627-639, 2001.
8. 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.
9. S. C. Nandy, B. B. Bhattacharya and A. Hernandez Barrera, Safety zone problem, Journal of Algorithms, vol. 37, pp. 538-569, 2000.
10. 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.
11. 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.
12. 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.
13. 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
14. 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.
15. 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.
16. T. Krishnan and S. C. Nandy Efficiency of Discriminant Analysis when Initial Samples are Classified Stochastically, Pattern Recognition, vol.23, pp. 529-537, 1990.
17. T. Krishnan and S. C. Nandy Efficiency of Logistic-Normal Stochastic Supervisor, Pattern Recognition, vol.23, pp. 529-537, 1990.
18. T. Krishnan and S. C. Nandy Discriminant Analysis with a Stochastic Supervisor, Pattern Recognition, vol.20, no.4, pp. 379-384, 1987.
19. 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.
20. 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.
21. 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.

Conferences:

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.
9. S. C. Nandy, Shattering a set of objects in 2D, Proc. Canadian Conf. on Computational Geometry, pp. 107-110, British Columbia, Canada, 1999.
10. 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.
11. 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.
12. 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.
13. 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.
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.
19. S. C. Nandy, B. B. Bhattacharya and S. Ray Efficient algorithm for identifying all maximal isothetic empty rectangles in VLSI layout design, in 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.