Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sandip Das
2010 – today
- 2013
[j31]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)- [j30]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013)
- [j29]Bhaswar B. Bhattacharya, Sandip Das: Disjoint empty convex pentagons in planar point sets. Periodica Mathematica Hungarica 66(1): 73-86 (2013)
- [c41]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das: Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220
- [c40]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid: The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207
- [c39]Barun Gorain, Partha Sarathi Mandal, Sandip Das: POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. ICDCN 2013: 463-464
- [c38]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar: Voronoi Game on Graphs. WALCOM 2013: 77-88
- 2012
- [c37]Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137
- 2011
- [j28]
- [c36]Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das: Minimum Width Rectangular Annulus. FAW-AAIM 2011: 364-374
- [c35]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das: Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON 2011: 213-224
- [c34]Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami: k-Enclosing Axis-Parallel Square. ICCSA (3) 2011: 84-93
- [c33]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das: Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109
- [i4]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)
- 2010
- [j27]Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010)
- [j26]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)
- [c32]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368
- [c31]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink: Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93
- [c30]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
- [i3]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)
2000 – 2009
- 2009
- [j25]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009)
- [j24]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)
- [j23]Debabrata Bardhan, Sasanka Roy, Sandip Das: Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geometry Appl. 19(4): 357-370 (2009)
- [j22]Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest Color-Spanning Object Revisited. Int. J. Comput. Geometry Appl. 19(5): 457-478 (2009)
- [j21]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009)
- [j20]Chandan Saha, Sandip Das: Covering a set of points in a plane using two parallel rectangles. Inf. Process. Lett. 109(16): 907-912 (2009)
- [j19]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)
- [e1]Sandip Das, Ryuhei Uehara (Eds.): WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5431, Springer 2009, ISBN 978-3-642-00201-4
- [i2]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink: On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009)
- 2008
- [j18]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)
- [j17]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)
- [j16]Sasanka Roy, Debabrata Bardhan, Sandip Das: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68(2): 265-273 (2008)
- [c29]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Maximal Covering by Two Isothetic Unit Squares. CCCG 2008
- [c28]Arindam Karmakar, Sasanka Roy, Sandip Das: Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110
- [i1]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)
- 2007
- [j15]Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
- [j14]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)
- [c27]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
- [c26]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172
- [c25]Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192
- [c24]Arindam Karmakar, Sasanka Roy, Sandip Das: Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276
- [c23]Chandan Saha, Sandip Das: Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA 2007: 214-218
- [c22]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
- 2006
- [j13]Malay Sen, P. Talukdar, Sandip Das: Chronological orderings of interval digraphs. Discrete Mathematics 306(14): 1601-1609 (2006)
- [j12]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)
- [j11]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)
- [j10]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)
- [c21]Debabrata Bardhan, Sasanka Roy, Sandip Das: Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19
- [c20]Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
- [c19]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
- 2005
- [j9]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)
- [c18]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Collection depot location problem in the plane. CCCG 2005: 76-79
- [c17]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
- [c16]Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy: Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420
- [c15]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
- [c14]Sasanka Roy, Debabrata Bardhan, Sandip Das: Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116
- [c13]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
- [c12]Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
- 2004
- [j8]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)
- [j7]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)
- [j6]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)
- [c11]Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
- [c10]Gautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429
- [c9]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
- 2003
- [j5]Sandip Das, P. Talukdar, Malay Sen: Homogeneously Representable Interval Bigraphs. Electronic Notes in Discrete Mathematics 15: 75-78 (2003)
- [j4]Malay Sen, P. Talukdar, Sandip Das: Chronological Orderings of Interval Digraph. Electronic Notes in Discrete Mathematics 15: 182-185 (2003)
- [j3]Jeet Chaudhuri, Subhas C. Nandy, Sandip Das: Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003)
- [j2]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)
- [c8]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
- 2002
- [c7]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
- [c6]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
- 2000
- [j1]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)
1990 – 1999
- 1999
- [c5]Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya: Synthesis of Symmetric Functions for Path-Delay Fault Testability. VLSI Design 1999: 512-517
- [c4]Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
- 1998
- [c3]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
- [c2]Sandip Das, Bhargab B. Bhattacharya: Channel routing in Manhattan-diagonal model. VLSI Design 1996: 43-48
- 1993
- [c1]Sandip Das, Bhargab B. Bhattacharya: Via Minimization in Channel Routing by Layout Modification. VLSI Design 1993: 109-110
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-25 21:17 CEST by the dblp team