Subhas C. Nandy

	2012
86		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: 1-10
85		Minati De, Subhas C. Nandy, Sasanka Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338
84		Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN 2012: 214-217
83		Minati De, Anil Maheshwari, Subhas C. Nandy: Space-efficient Algorithms for Visibility Problems in Simple Polygon CoRR abs/1204.2634: (2012)
	2011
82		Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011
81		Minati De, Gautam K. Das, Subhas C. Nandy: Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011
80		Minati De, Subhas C. Nandy: Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011
79		Minati De, Subhas C. Nandy: Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle CoRR abs/1104.3076: (2011)
78		John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems CoRR abs/1111.2918: (2011)
77		Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy: Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. 22(4): 983-998 (2011)
76		Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)
	2010
75		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: 207-210
74		Bhaswar B. Bhattacharya, Subhas C. Nandy: New variations of the reverse facility location problem. CCCG 2010: 241-244
73		Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami: Cluster connecting problem inside a polygon. CCCG 2010: 265-268
72		Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368
71		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: 102-112
70		John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location CoRR abs/1004.0558: (2010)
69		Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network CoRR abs/1006.2955: (2010)
68		Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010)
67		Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Inform. 99(3): 315-324 (2010)
66		Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Recognition of largest empty orthoconvex polygon in a point set. Inf. Process. Lett. 110(17): 746-752 (2010)
	2009
65		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: 47-58
64		Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92
63		Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee: FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embedded Comput. Syst. 9(2): (2009)
62		Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. 42(6-7): 632-638 (2009)
61		Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009)
60		Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. 109(18): 1060-1065 (2009)
59		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest Color-Spanning Object Revisited. Int. J. Comput. Geometry Appl. 19(5): 457-478 (2009)
	2008
58		Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 2008
57		Gautam K. Das, Subhas C. Nandy: Weighted broadcast in linear radio networks. Inf. Process. Lett. 106(4): 136-143 (2008)
56		Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy: Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008)
55		Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008)
	2007
54		Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy: Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152
53		Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
52		Partha P. Goswami, Sandip Das, Subhas C. Nandy: Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102(4): 163-168 (2007)
51		Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. 18(3): 619-635 (2007)
	2006
50		Gautam K. Das, Subhas C. Nandy: Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353
49		Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
48		Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
47		Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha: Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distrib. Comput. 66(11): 1353-1358 (2006)
46		Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognition 39(9): 1662-1671 (2006)
45		Gautam K. Das, Sandip Das, Subhas C. Nandy: Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. 352(1-3): 332-341 (2006)
	2005
44		Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
43		Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy: Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420
42		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) 2005: 827-837
41		Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha: Placing a Given Number of Base Stations to Cover a Convex Region. IWDC 2005: 57-62
40		Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
39		Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty: Hot Spots and Zones in a Chip: A Geometrician's View. VLSI Design 2005: 691-696
38		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett. 94(6): 259-266 (2005)
	2004
37		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
36		Gautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429
35		Sasanka Roy, Sandip Das, Subhas C. Nandy: A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) 2004: 42-52
34		Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100
33		Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC 2004: 412-423
32		Partha P. Goswami, Sandip Das, Subhas C. Nandy: Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29(3): 163-175 (2004)
31		Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004)
30		Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. Journal of Circuits, Systems, and Computers 13(5): 1019-1038 (2004)
	2003
29		Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC 2003: 36-45
28		Subhas C. Nandy, Bhargab B. Bhattacharya: On finding an empty staircase polygon of largest area (width) in a planar point-set. Comput. Geom. 26(2): 143-171 (2003)
27		Jeet Chaudhuri, Subhas C. Nandy, Sandip Das: Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003)
26		Subhas C. Nandy, Sandip Das, Partha P. Goswami: An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 1-3(299): 273-288 (2003)
	2002
25		Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
24		Partha P. Goswami, Sandip Das, Subhas C. Nandy: Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT 2002: 69-79
23		Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya: Monotone bipartitioning problem in a planar point set with applications to VLSI. ACM Trans. Design Autom. Electr. Syst. 7(2): 231-248 (2002)
22		Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy: Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002)
21		Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama: Shattering a set of objects in 2D. Discrete Applied Mathematics 122(1-3): 183-194 (2002)
	2001
20		Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy: Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. ISCAS (5) 2001: 395-398
19		Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Searching networks with unrestricted edge costs. IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(6): 497-507 (2001)
18		Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001)
	2000
17		Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically Maintaining the Widest k -Dense Corridor. CIAC 2000: 187-198
16		Subhas C. Nandy: An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. COCOON 2000: 281-290
15		Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera: Safety Zone Problem. J. Algorithms 37(2): 538-569 (2000)
	1999
14		Subhas C. Nandy: Shattering a set of objects in 2d. CCCG 1999
13		Jeet Chaudhuri, Subhas C. Nandy: Generalized Shooter Location Problem. COCOON 1999: 389-399
12		Jeet Chaudhuri, Subhas C. Nandy: Largest Empty Rectangle among a Point Set. FSTTCS 1999: 34-46
11		Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
	1998
10		Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: Partitioning VLSI Floorplans by Staircase Channels for Global Routing. VLSI Design 1998: 59-64
9		Pinaki Mitra, Subhas C. Nandy: Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. J. Algorithms 28(2): 315-338 (1998)
	1996
8		Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Shooter Location Problem. CCCG 1996: 93-98
7		Pinaki Mitra, Subhas C. Nandy: Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. FSTTCS 1996: 76-87
6		Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Geometric bipartitioning problem and its applications to VLSI. VLSI Design 1996: 400-405
	1994
5		Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya: Location of the Largest Empty Rectangle among Arbitrary Obstacles. FSTTCS 1994: 159-170
	1990
4		Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray: Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS 1990: 255-269
3		Thriyambakam Krishnan, Subhas C. Nandy: Efficiency of logistic-normal stochastic supervision. Pattern Recognition 23(11): 1275-1279 (1990)
2		Thriyambakam Krishnan, Subhas C. Nandy: Efficiency of discriminant analysis when initial samples are classified stochastically. Pattern Recognition 23(5): 529-537 (1990)
	1987
1		T. Krishnan, Subhas C. Nandy: Discriminant analysis with a stochastic supervisor. Pattern Recognition 20(4): 379-384 (1987)

Coauthor Index

1	Mustaq Ahmed	[76]
2	Boris Aronov	[34] [55]
3	Tetsuo Asano	[17] [18] [21] [22] [34] [55]
4	John Augustine	[70] [78]
5	Pritha Banerjee	[43] [63]
6	Subhasis Bhattacharjee	[43] [44] [61] [63]
7	Bhargab B. Bhattacharya	[4] [5] [6] [8] [10] [11] [15] [19] [20] [23] [28] [29] [30] [39] [46] [58] [66] [67] [71]
8	Bhaswar B. Bhattacharya	[74]
9	Binay K. Bhattacharya	[72]
10	Arijit Bishnu	[29] [46] [63] [69] [71] [73] [77] [84] [86]
11	B. Chakraborty	[39]
12	Jeet Chaudhuri	[12] [13] [27]
13	Gautam K. Das	[33] [36] [41] [45] [47] [49] [50] [51] [54] [56] [57] [60] [64] [68] [75] [81]
14	Sandip Das	[11] [24] [25] [26] [27] [29] [31] [32] [35] [36] [37] [38] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [52] [53] [54] [56] [59] [61] [62] [63] [68] [70] [71] [72] [78]
15	Parthasarathi Dasgupta (P. S. Dasgupta)	[6] [19] [23]
16	Dinesh Dash	[69] [84] [86]
17	Minati De	[79] [80] [81] [82] [83] [85]
18	Sasthi C. Ghosh	[33] [51]
19	Subir Kumar Ghosh	[65]
20	Partha P. Goswami	[24] [25] [26] [31] [32] [37] [38] [42] [52] [59] [65] [73]
21	Arobinda Gupta	[69] [84] [86]
22	Tomohiro Harayama	[17] [18] [21]
23	Antonio Hernández-Barrera	[15] [22]
24	Arindam Karmakar	[48] [62] [72]
25	Yosuke Kikuchi	[34] [55]
26	T. Krishnan	[1]
27	Thriyambakam Krishnan	[2] [3]
28	Abhay Kumar	[77]
29	Anil Maheshwari	[65] [70] [76] [78] [82] [83]
30	Subhashis Majumder	[10] [20] [30] [39] [67]
31	Pinaki Mitra	[7] [9]
32	Debashis Mondal	[77]
33	Asish Mukhopadhyay	[75]
34	Debapriyay Mukhopadhyay	[60] [64]
35	Krishnendu Mukhopadhyaya	[8] [58] [66] [77]
36	Sudebkumar Prasant Pal	[65]
37	Peichen Pan	[23]
38	Sangameswar Patil	[75]
39	S. V. Rao	[75]
40	Sibabrata Ray	[4]
41	Sasanka Roy	[25] [31] [35] [40] [44] [48] [53] [54] [56] [61] [62] [70] [76] [78] [85]
42	Sanjib Sadhu	[73]
43	Swami Sarvattomananda	[65] [70] [78]
44	Shinji Sasahara	[34] [55]
45	Anup K. Sen	[6] [19]
46	Arani Sinha	[5]
47	Bhabani P. Sinha	[41] [47]
48	Michiel H. M. Smid	[82]
49	Susmita Sur-Kolay	[20] [39] [43] [63]
50	Takeaki Uno	[34] [55]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page