dblp.uni-trier.dewww.uni-trier.de

Sandip Das

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
49 Sandip Das, Ryuhei Uehara: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings Springer 2009
2008
48 Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Maximal Covering by Two Isothetic Unit Squares. CCCG 2008
47EEArindam Karmakar, Sasanka Roy, Sandip Das: Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110
46EEMustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains CoRR abs/0805.1401: (2008)
45EEArindam Karmakar, Sasanka Roy, Sandip Das: Fast computation of smallest enclosing circle with center on a query line segment. Inf. Process. Lett. 108(6): 343-346 (2008)
44EEGautam 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)
43EESasanka Roy, Debabrata Bardhan, Sandip Das: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68(2): 265-273 (2008)
2007
42 Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172
41 Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192
40 Arindam Karmakar, Sasanka Roy, Sandip Das: Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276
39 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
38EEChandan Saha, Sandip Das: Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA 2007: 214-218
37 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
36EESasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
35EEPartha 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
34EEDebabrata Bardhan, Sasanka Roy, Sandip Das: Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19
33EEGautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
32EESasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
31EEMalay Sen, P. Talukdar, Sandip Das: Chronological orderings of interval digraphs. Discrete Mathematics 306(14): 1601-1609 (2006)
30EEGautam 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)
29EEArijit 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)
28EEGautam 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
27EESasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
26EERobert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Collection depot location problem in the plane. CCCG 2005: 76-79
25 Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy: Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420
24EESandip 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
23EESasanka Roy, Debabrata Bardhan, Sandip Das: Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116
22EEGautam 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
21EESasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
20EESandip 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
19EESandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
18EEGautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429
17EESasanka 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
16EESandip 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)
15EEPartha 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)
14EESasanka 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
13EEArijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC 2003: 36-45
12EEMalay Sen, P. Talukdar, Sandip Das: Chronological Orderings of Interval Digraph. Electronic Notes in Discrete Mathematics 15: 182-185 (2003)
11EESandip Das, P. Talukdar, Malay Sen: Homogeneously Representable Interval Bigraphs. Electronic Notes in Discrete Mathematics 15: 75-78 (2003)
10EEJeet Chaudhuri, Subhas C. Nandy, Sandip Das: Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003)
9EESubhas 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
8EESasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
7EEPartha 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
6EESusanta 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
5EESusanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya: Synthesis of Symmetric Functions for Path-Delay Fault Testability. VLSI Design 1999: 512-517
4EESandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
1998
3EESandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya: Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. VLSI Design 1998: 65-
1996
2EESandip 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

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)