Sandip Das

2008
44	EE	Arindam Karmakar, Sasanka Roy, Sandip Das: Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110
43	EE	Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains CoRR abs/0805.1401: (2008)
42	EE	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)
41	EE	Sasanka Roy, Debabrata Bardhan, Sandip Das: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68(2): 265-273 (2008)
2007
40		Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172
39		Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192
38		Arindam Karmakar, Sasanka Roy, Sandip Das: Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276
37		Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi: Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36
36	EE	Chandan Saha, Sandip Das: Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA 2007: 214-218
35		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
34	EE	Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
33	EE	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)
2006
32	EE	Debabrata Bardhan, Sasanka Roy, Sandip Das: Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19
31	EE	Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
30	EE	Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
29	EE	Malay Sen, P. Talukdar, Sandip Das: Chronological orderings of interval digraphs. Discrete Mathematics 306(14): 1601-1609 (2006)
28	EE	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)
27	EE	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)
26	EE	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
25	EE	Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
24	EE	Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Collection depot location problem in the plane. CCCG 2005: 76-79
23		Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy: Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420
22	EE	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
21	EE	Sasanka Roy, Debabrata Bardhan, Sandip Das: Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116
20	EE	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
19	EE	Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
18	EE	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
17	EE	Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
16	EE	Gautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429
15	EE	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
14	EE	Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya: Manhattan-diagonal routing in channels and switchboxes. ACM Trans. Design Autom. Electr. Syst. 9(1): 75-104 (2004)
13	EE	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)
12	EE	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)
2003
11	EE	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
10	EE	Jeet Chaudhuri, Subhas C. Nandy, Sandip Das: Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003)
9	EE	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
8	EE	Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
7	EE	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
2000
6	EE	Susanta Chakrabarti, Sandip Das, Debesh Kumar Das, Bhargab B. Bhattacharya: Synthesis of symmetric functions for path-delay fault testability. IEEE Trans. on CAD of Integrated Circuits and Systems 19(9): 1076-1081 (2000)
1999
5	EE	Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya: Synthesis of Symmetric Functions for Path-Delay Fault Testability. VLSI Design 1999: 512-517
4	EE	Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
1998
3	EE	Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya: Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. VLSI Design 1998: 65-
1996
2	EE	Sandip Das, Bhargab B. Bhattacharya: Channel routing in Manhattan-diagonal model. VLSI Design 1996: 43-48
1993
1		Sandip Das, Bhargab B. Bhattacharya: Via Minimization in Channel Routing by Layout Modification. VLSI Design 1993: 109-110

Coauthor Index

1	Mustaq Ahmed	[43]
2	Pritha Banerjee	[23]
3	Debabrata Bardhan	[21] [32] [41]
4	Boaz Ben-Moshe	[37]
5	Robert Benkoczi	[24]
6	Subhasis Bhattacharjee	[23] [25]
7	Bhargab B. Bhattacharya	[1] [2] [3] [4] [5] [6] [11] [14] [27]
8	Binay K. Bhattacharya	[24] [37]
9	Arijit Bishnu	[11] [27]
10	Susanta Chakrabarti	[6]
11	Susanta Chakraborty	[5]
12	Jeet Chaudhuri	[10]
13	Debesh Kumar Das (Debesh K. Das)	[5] [6]
14	Gautam K. Das	[16] [20] [26] [28] [31] [35] [42]
15	Daya Ram Gaur	[37]
16	Partha P. Goswami	[7] [8] [9] [12] [13] [17] [18] [22] [33] [40]
17	Arindam Karmakar	[30] [38] [44]
18	Sachin Lodha	[39] [43]
19	Anna Lubiw	[43]
20	Priya Ranjan Sinha Mahapatra	[40]
21	Anil Maheshwari	[39] [43]
22	Subhas C. Nandy	[4] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [19] [20] [22] [23] [25] [26] [27] [28] [30] [31] [33] [34] [35] [42]
23	Sasanka Roy	[8] [12] [15] [19] [21] [25] [30] [32] [34] [35] [38] [39] [41] [42] [43] [44]
24	Chandan Saha	[36]
25	Jeff Sember	[24]
26	Malay Sen	[29]
27	Qiaosheng Shi	[37]
28	Bhabani P. Sinha	[20] [28]
29	Susmita Sur-Kolay	[3] [14] [23]
30	P. Talukdar	[29]

Colors in the list of coauthors