Personal:
Name: Subhas Chandra Nandy
Date of birth: July 2, 1959
Address (Residence) :
N. S. Dutta Ghat Road
P. O. Sukchar
Dt. 24 Parganas (North)
Pin 743179, W. Bengal, INDIA
Phone No. (0091)(033)2553 6394
Address (office) :
Advanced Computing and Microelectronics Unit
Indian Statistical Institute(ISI)
203, B.T.Road
Kolkata, West Bengal, India
Pin 
700108
Phone:
(0091)(033)25753008
Fax:
(0091)(033)25773035/6630
Email: nandysc@isical.ac.in
Academic Qualifications:
Ph.D. in Computer Science, Univ. of Calcutta, Kolkata, 1996.
M.Tech. in Computer Science, Indian Statistical Institute, Kolkata, 1985.
M.Sc. in Statistics, Univ. of Calcutta, Kolkata, 1981.
B.Sc. (Hons.) in Statistics, Univ. of Calcutta, Kolkata, 1978.
Work Experience :
 Professor in Indian Statistical Institute, Kolkata, from
June 2004.
 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 :
22 years in the following areas :
 Discrete and Computational Geometry
 Graph Algorithms
 VLSI Design
 Data Structure & Analysis of Algorithms
Research guidance:
Ph.D. Students:
 Minati De, Spaceefficient Algorithms for Geometric Optimization Problems , submitted at
Indian Statistical Institute.
 Gautam K. Das, Facility location problems  algorithms and applications,
(graduated from Indian Statistical Institute).
 Partha P. Goswami, Application of computational geometry in visibility graph recognition and
nearest neighbor problems, (graduated from Calcutta University).
M.Tech(CS) Students (Dissertation) :
 More than 15 students of ISI M.Tech.(CS) worked on various problems of geometric and VLSI physical design Algorithms.
List of Publications:
Thesis: Studies on Some Geometric Algorithms with Applications to
VLSI, Calcutta University, 1996.
Journals:
 M. De, A. Maheshwari, S. C. Nandy, M. H. M. Smid, An inplace minmax priority search tree , Comput. Geom. , vol. 46(3), pp. 310327, 2013.
 J. Augustine, S. Das, A. Maheshwari, S. C. Nandy, S. Roy, S. Sarvattomananda, Localized geometric query problems, Comput. Geom., vol. 46(3), pp. 340357, 2013.
 A. Khan, S. P. Pal, M. Aanjaneya, A. Bishnu, S. C. Nandy, Diffuse reflection diameter and radius for convexquadrilateralizable polygons, Discrete Applied Mathematics , vol. 161(1011), pp. 14961505, 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. 477485, 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. 176190, 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. 12291237, 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. 983998, 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. 182189, 2011.
 G. K. Das, S. Das, S. C. Nandy, Homogeneous 2hop broadcast in 2D , Comput. Geom. , vol. 43(2), pp. 182190, 2010
 S. Majumder, S. C. Nandy, B. B. Bhattacharya, Separating MultiColor Points on a Plane with Fewest AxisParallel Lines , Fundam. Inform. , vol. 99(3), pp. 315324, 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. 746752, 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(67), pp. 632638, 2009.
 S. Das, P. P. Goswami, S. C. Nandy, Smallest ColorSpanning Object Revisited, Int. J. Comput. Geometry Appl. , vol. 19(5), pp. 457478, 2009.
 S. Roy, S. Bhattacharjee, S. Das, S. C. Nandy, A new fast heuristic for labeling points , Inf. Process. Lett., vol. 109(10), pp. 478484, 2009.

G. K. Das, D. Mukhopadhyay, S. C. Nandy, Improved algorithm for the widest empty 1corner corridor, Inf. Process. Lett. , vol. 109(18), pp. 10601065, 2009.

P. Banerjee, S. SurKolay, A. Bishnu, S. Das, S. C. Nandy, S. Bhattacharjee, FPGA placement using spacefilling 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 BaseStation Placement Problem on the Boundary of a Convex Region , Int. J. Found. Comput. Sci. , vol. 19(2), pp. 405427,2008.

G. K. Das, S. C. Nandy, Weighted broadcast in linear radio networks, Inf. Process. Lett. vol. 106(4), pp. 136143,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. 143156, 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.
619636, 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.
115133, 2007.
 P. P. Goswami, S. Das and S. C. Nandy, Chromatic distribution of knearest neighbors of a line segment in a planar colored point set , Information Processing Letters,
vol. 102, pp. 163168, 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. 16621671, 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. 13531358, 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(13), pp. 332341, 2006.
 P. P. Goswami, S. Das and S. C. Nandy, Smallest kpoint enclosing rectangle and square of arbitrary orientation, Information Processing Letters, vol 94(6), pp. 259266, 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. 10191038, 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. 163175, 2004.
 S. Roy, P. P. Goswami, S. Das and S. C. Nandy, Optimal Algorithm for a Special Pointlabeling Problem, Information Processing Letters, vol. 89, pp. 9198, 2004.
 S. C. Nandy and B. B. Bhattacharya, On Finding an Empty Staircase Polygon of Largest Area (Width) in a Planar Pointset, Computational Geometry  Theory and Applications, vol. 26, pp. 143171, 2003.
 J. Chaudhouri, S. C. Nandy and S. Das, Largest empty rectangle among a point set, Journal of Algorithms, vol. 54, pp. 5478, 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 (13), pp. 273288, 2003.
 T. Asano, A. HernandezBarrera, and S. C. Nandy The Minkowski sun of a convex polygon and a polygonal terrain, Computational Geometry : Theory and Applications, vol. 23(3), pp. 257269, 2002.
 S. C. Nandy, T. Asano and T. Harayama, Shattering a set of objects in 2D, in Discrete Applied Mathematics, vol 122, pp. 183194, 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. 497507, November 2001.
 S. C. Nandy, T. Harayama and T. Asano, Dynamically Maintaining the Widest kdense Corridor, Theoretical Computer Science, vol. 255,pp. 627639, 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. 538569, 2000.
 A. Chatterjee, S. S. Sarkar, S. C. Nandy, Petrological mixing  a regression approach, Calcutta Statistical association Bulletin, vol. 50, Nos. 197198, pp. 7994, 2000.
 P. Mitra and S. C. Nandy Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles, Journal of Algorithms, vol. 28, pp. 315338, 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. 1120, 1998.
 S. C. Nandy, G. N. Nandakumar and B. B. Bhattacharya Efficient Algorithms for Single and Twolayer Linear Placement of Parallel Graphs, Computers and Mathematics with applications, vol. 34, No. 12, pp. 121135, 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. 4561, 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. 4451, 1991.
 T. Krishnan and S. C. Nandy Efficiency of Discriminant Analysis when Initial Samples are Classified Stochastically, Pattern Recognition, vol.23, pp. 529537, 1990.
 T. Krishnan and S. C. Nandy Efficiency of LogisticNormal Stochastic Supervisor, Pattern Recognition, vol.23, pp. 529537, 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.128135.
 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. 104118, 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. 379384, 1987.
Conferences:
 Minati De, Subhas C. Nandy, Sasanka Roy: Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510521
 Minati De, Subhas C. Nandy, Sasanka Roy: InPlace Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAWAAIM 2012: 327338
 Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS 2012: 110
 Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Finding the Quality of Line Coverage of a Sensor Network  (Poster Paper). ICDCN 2012: 214217
 Minati De, Gautam K. Das, Subhas C. Nandy: Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011
 Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An InPlace Priority Search Tree. CCCG 2011
 Minati De, Subhas C. Nandy: Spaceefficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011
 Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao: Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207210
 Bhaswar B. Bhattacharya, Subhas C. Nandy: New variations of the reverse facility location problem. CCCG 2010: 241244
 Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami: Cluster connecting problem inside a polygon. CCCG 2010: 265268
 Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354368
 Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM 2010: 102112
 Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 4758
 Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved Algorithm for a Widest 1Corner Corridor. WALCOM 2009: 8392
 Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 2008
 Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy: Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151152
 Gautam K. Das, Subhas C. Nandy: Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343353
 Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2Hops Broadcast in 2D. ICCSA (2) 2006: 750759
 Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765776
 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. 5762, 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. 155158, 2005.
 P. Banerjee, S. Bhattacharjee, S. SurKolay, S. Das and
S. C. Nandy, Fast FPGA Placement using Spacefilling Curve, Proc. of the 2005 Int. Conf.
on Field Programmable Logic and Applications (FPL), pp. 415420, 2005.
 S. Das, P. P. Goswami and S. C. Nandy, Recognition of Minimum Width ColorSpanning Corridor and Minimum Area ColorSpanning Rectangle,
Proc. Computational Geometry and Applications (in conjunction
with The 2005 Int. Conf. on Computational Science and its Applications),
LNCS 3481, pp. 827837, 2005.
 S. Roy, S. Das and S. C. Nandy, Shortest Monotone Descent Path Problem in Polyhedral Terrain,
Proc. 22^{nd} Symp. on Theoretical Aspects of Computer Science (STACS), pp. 281292, 2005.
 S. Majumder, S. SurKolay, 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. 691696, 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^{th} Int. Symp. on Algorithms and
Computation (ISAAC), pp. 89100, 2004.
 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. 412423, 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. 420429, 2004.
 G. K. Das, S. C. Ghosh and S. C. Nandy, An Efficient Heuristic Algorithm for 2D hHops Range Assignment
Problem, Proc. IEEE Global Telecommunication Conference (GLOBECOM), vol. 3, pp. 10511055, 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. 116119, 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. 4252, 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, 2831
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, SWAT2002, LNCS 2369, pp. 6979, 2002.
 S. Roy, P. P. Goswami, S. Das and S. C. Nandy, Optimal Algorithm
for a Special Pointlabeling Problem, Scandinavian Workshop on
Algorithmic Theory, SWAT2002, LNCS 2369, pp. 110120, 2002.
 S. Majumder, S. SurKolay, 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 69, 2001, Sydney, Australia, pp. 395398.
 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. 281290,
Sydney, Australia, July 2000.
 S. C. Nandy, T. Harayama and T. Asano, Dynamically Maintaining
the Widest kdense Corridor,
Proc. Italian Conference on Algorithms and Computation, Lecture Notes
in Computer Science, LNCS1767, Springer, pp. 187198, 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. 3446, 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, LNCS1627, Springer, pp. 389399, Japan, 1999.
 S. C. Nandy, Shattering a set of objects in 2D, Proc.
Canadian Conf. on Computational Geometry, pp. 107110, British Columbia, Canada,
1999.
 S. Das, S. C. Nandy and B. B. Bhattacharya, Highperformence
MCM routing  A new approach, Int. Conference in VLSI Design,
IEEE CS Press, pp. 564569, January 1999.
 P. Mahalingam, S. C. Nandy, S. SurKolay, 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. 5964, 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. 7687,
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. 9398, August 1215, 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. 400405, 1996.
 S. C. Nandy, A. Sinha and B. B. Bhattacharya
Largest empty isothetic rectangle among a set of nonisothetic
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. 159170.
 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. 205229, June 1994.
 S. Das, S. C. Nandy and B. B. Bhattacharya An improved
heuristic algorithm for overthecell channel routing, in Proc. (IEEE)
International Symposium on Circuits and Systems (ISCAS) , pp. 31063109,
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. 255269.
My Home
 ACMU Home
 ISI Home