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 |
47 | EE | Arindam Karmakar,
Sasanka Roy,
Sandip Das:
Guarding Exterior Region of a Simple Polygon.
WALCOM 2008: 100-110 |
46 | 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) |
45 | EE | Arindam 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) |
44 | 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) |
43 | 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 |
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 |
38 | EE | Chandan 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 |
36 | EE | Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Shortest monotone descent path problem in polyhedral terrain.
Comput. Geom. 37(2): 115-133 (2007) |
35 | 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 |
34 | EE | Debabrata Bardhan,
Sasanka Roy,
Sandip Das:
Optimal Guard Placement Problem Under L-Visibility.
ICCSA (1) 2006: 10-19 |
33 | EE | Gautam K. Das,
Sandip Das,
Subhas C. Nandy:
Homogeneous 2-Hops Broadcast in 2D.
ICCSA (2) 2006: 750-759 |
32 | 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 |
31 | EE | Malay Sen,
P. Talukdar,
Sandip Das:
Chronological orderings of interval digraphs.
Discrete Mathematics 306(14): 1601-1609 (2006) |
30 | 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) |
29 | 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) |
28 | 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 |
27 | EE | Sasanka Roy,
Subhasis Bhattacharjee,
Sandip Das,
Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem.
CCCG 2005: 155-158 |
26 | EE | Robert 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 |
24 | 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 |
23 | EE | Sasanka Roy,
Debabrata Bardhan,
Sandip Das:
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.
ICDCIT 2005: 105-116 |
22 | 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 |
21 | EE | Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Shortest Monotone Descent Path Problem in Polyhedral Terrain.
STACS 2005: 281-292 |
20 | 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 |
19 | EE | Sandip Das,
Partha P. Goswami,
Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation.
CCCG 2004: 116-119 |
18 | EE | Gautam K. Das,
Sandip Das,
Subhas C. Nandy:
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.
HiPC 2004: 420-429 |
17 | 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 |
16 | 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) |
15 | 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) |
14 | 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 |
13 | 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 |
12 | EE | Malay Sen,
P. Talukdar,
Sandip Das:
Chronological Orderings of Interval Digraph.
Electronic Notes in Discrete Mathematics 15: 182-185 (2003) |
11 | EE | Sandip Das,
P. Talukdar,
Malay Sen:
Homogeneously Representable Interval Bigraphs.
Electronic Notes in Discrete Mathematics 15: 75-78 (2003) |
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 |