The SCEAS System
| |||||||

## Search the dblp DataBase
Sandip Das:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
**Collection depot location problem in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:76-79 [Conf] - Sandip Das, Partha P. Goswami, Subhas C. Nandy
**Smallest k point enclosing rectangle of arbitrary orientation.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:116-119 [Conf] - Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
**A Fast Algorithm for Point Labeling Problem.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:155-158 [Conf] - Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
**An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.**[Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:36-45 [Conf] - Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy
**Fast FPGA Placement using Space-filling Curve.**[Citation Graph (0, 0)][DBLP] FPL, 2005, pp:415-420 [Conf] - Gautam K. Das, Sandip Das, Subhas C. Nandy
**Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.**[Citation Graph (0, 0)][DBLP] HiPC, 2004, pp:420-429 [Conf] - Debabrata Bardhan, Sasanka Roy, Sandip Das
**Optimal Guard Placement Problem Under L-Visibility.**[Citation Graph (0, 0)][DBLP] ICCSA (1), 2006, pp:10-19 [Conf] - Gautam K. Das, Sandip Das, Subhas C. Nandy
**Homogeneous 2-Hops Broadcast in 2D.**[Citation Graph (0, 0)][DBLP] ICCSA (2), 2006, pp:750-759 [Conf] - Sandip Das, Partha P. Goswami, Subhas C. Nandy
**Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.**[Citation Graph (0, 0)][DBLP] ICCSA (1), 2005, pp:827-837 [Conf] - Sasanka Roy, Sandip Das, Subhas C. Nandy
**A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface.**[Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:42-52 [Conf] - Sasanka Roy, Debabrata Bardhan, Sandip Das
**Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.**[Citation Graph (0, 0)][DBLP] ICDCIT, 2005, pp:105-116 [Conf] - Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
**Placing a Given Number of Base Stations to Cover a Convex Region.**[Citation Graph (0, 0)][DBLP] IWDC, 2005, pp:57-62 [Conf] - Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
**Constrained Minimum Enclosing Circle with Center on a Query Line Segment.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:765-776 [Conf] - Sasanka Roy, Sandip Das, Subhas C. Nandy
**Shortest Monotone Descent Path Problem in Polyhedral Terrain.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:281-292 [Conf] - Partha P. Goswami, Sandip Das, Subhas C. Nandy
**Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.**[Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:69-79 [Conf] - Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
**Optimal Algorithm for a Special Point-Labeling Problem.**[Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:110-120 [Conf] - Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya
**Synthesis of Symmetric Functions for Path-Delay Fault Testability.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1999, pp:512-517 [Conf] - Sandip Das, Bhargab B. Bhattacharya
**Via Minimization in Channel Routing by Layout Modification.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1993, pp:109-110 [Conf] - Sandip Das, Bhargab B. Bhattacharya
**Channel routing in Manhattan-diagonal model.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1996, pp:43-48 [Conf] - Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
**High Performance MCM Routing: A New Approach.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1999, pp:564-569 [Conf] - Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya
**Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1998, pp:65-0 [Conf] - Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
**Base Station Placement Problem on the Boundary of a Convex Region.**[Citation Graph (0, 0)][DBLP] WALCOM, 2007, pp:151-152 [Conf] - Chandan Saha, Sandip Das
**Covering a Set of Points in a Plane Using Two Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] ICCTA, 2007, pp:214-218 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:3, pp:163-175 [Journal] - Malay Sen, P. Talukdar, Sandip Das
**Chronological orderings of interval digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:14, pp:1601-1609 [Journal] - Sandip Das, Partha P. Goswami, Subhas C. Nandy
**Smallest**[Citation Graph (0, 0)][DBLP]*k*-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett., 2005, v:94, n:6, pp:259-266 [Journal] - Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
**Optimal algorithm for a special point-labeling problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:2, pp:91-98 [Journal] - Partha P. Goswami, Sandip Das, Subhas C. Nandy
**Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:4, pp:163-168 [Journal] - Jeet Chaudhuri, Subhas C. Nandy, Sandip Das
**Largest empty rectangle among a point set.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:46, n:1, pp:54-78 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1353-1358 [Journal] - Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
**Simple algorithms for partial point set pattern matching under rigid motion.**[Citation Graph (0, 0)][DBLP] Pattern Recognition, 2006, v:39, n:9, pp:1662-1671 [Journal] - Susanta Chakrabarti, Sandip Das, Debesh Kumar Das, Bhargab B. Bhattacharya
**Synthesis of symmetric functions for path-delay fault testability.**[Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:9, pp:1076-1081 [Journal] - Gautam K. Das, Sandip Das, Subhas C. Nandy
**Range assignment for energy efficient broadcasting in linear radio networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:332-341 [Journal] - Subhas C. Nandy, Sandip Das, Partha P. Goswami
**An efficient k nearest neighbors searching algorithm for a query line.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:299, pp:273-288 [Journal] - Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya
**Manhattan-diagonal routing in channels and switchboxes.**[Citation Graph (0, 0)][DBLP] ACM Trans. Design Autom. Electr. Syst., 2004, v:9, n:1, pp:75-104 [Journal] - Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari
**Approximate Shortest Descent Path on a Terrain.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:189-192 [Conf] - Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
**Covering Points by Isothetic Unit Squares.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:169-172 [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
**Computing a planar widest empty alpha-siphon in o(n**[Citation Graph (0, 0)][DBLP]^{3}) time. CCCG, 2007, pp:33-36 [Conf] - Arindam Karmakar, Sasanka Roy, Sandip Das
**Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:273-276 [Conf] - Sasanka Roy, Sandip Das, Subhas C. Nandy
**Shortest monotone descent path problem in polyhedral terrain.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:2, pp:115-133 [Journal] **Maximal Covering by Two Isothetic Unit Squares.**[Citation Graph (, )][DBLP]**A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion.**[Citation Graph (, )][DBLP]**Guarding Exterior Region of a Simple Polygon.**[Citation Graph (, )][DBLP]**Computation of Non-dominated Points Using Compact Voronoi Diagrams.**[Citation Graph (, )][DBLP]**Constrained minimum enclosing circle with center on a query line segment.**[Citation Graph (, )][DBLP]**Single facility collection depots location problem in the plane.**[Citation Graph (, )][DBLP]**Homogeneous 2-hop broadcast in 2D.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Shortest Descending Paths in Terrains**[Citation Graph (, )][DBLP]**On Finding Non-dominated Points using Compact Voronoi Diagrams**[Citation Graph (, )][DBLP]**Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |