The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Subhas C. Nandy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gautam K. Das, Subhas C. Nandy
    Weighted Broadcast in Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:343-353 [Conf]
  2. 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]
  3. Subhas C. Nandy
    Shattering a set of objects in 2d. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  4. Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
    Shooter Location Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:93-98 [Conf]
  5. 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]
  6. 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]
  7. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
    Dynamically Maintaining the Widest k -Dense Corridor. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:187-198 [Conf]
  8. Jeet Chaudhuri, Subhas C. Nandy
    Generalized Shooter Location Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:389-399 [Conf]
  9. Subhas C. Nandy
    An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:281-290 [Conf]
  10. 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]
  11. Jeet Chaudhuri, Subhas C. Nandy
    Largest Empty Rectangle among a Point Set. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:34-46 [Conf]
  12. Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray
    Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:255-269 [Conf]
  13. Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya
    Location of the Largest Empty Rectangle among Arbitrary Obstacles. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:159-170 [Conf]
  14. Pinaki Mitra, Subhas C. Nandy
    Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:76-87 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
    A Generalization of Magic Squares with Applications to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:89-100 [Conf]
  20. Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy
    Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2001, pp:395-398 [Conf]
  21. 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]
  22. Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
    Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:412-423 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Parthasarathi Dasgupta, A. K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
    Geometric bipartitioning problem and its applications to VLSI. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1996, pp:400-405 [Conf]
  28. 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]
  29. Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya
    Partitioning VLSI Floorplans by Staircase Channels for Global Routing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1998, pp:59-64 [Conf]
  30. Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty
    Hot Spots and Zones in a Chip: A Geometrician's View. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 2005, pp:691-696 [Conf]
  31. 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]
  32. Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy
    Translating a convex polyhedron over monotone polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:257-269 [Journal]
  33. 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]
  34. Subhas C. Nandy, Bhargab B. Bhattacharya
    On finding an empty staircase polygon of largest area (width) in a planar point-set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:143-171 [Journal]
  35. Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama
    Shattering a set of objects in 2D. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:183-194 [Journal]
  36. Sandip Das, Partha P. Goswami, Subhas C. Nandy
    Smallest k-point enclosing rectangle and square of arbitrary orientation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:6, pp:259-266 [Journal]
  37. 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]
  38. 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]
  39. 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]
  40. Pinaki Mitra, Subhas C. Nandy
    Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:315-338 [Journal]
  41. Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera
    Safety Zone Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:538-569 [Journal]
  42. Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya
    On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. [Citation Graph (0, 0)][DBLP]
    Journal of Circuits, Systems, and Computers, 2004, v:13, n:5, pp:1019-1038 [Journal]
  43. 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]
  44. 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]
  45. T. Krishnan, Subhas C. Nandy
    Discriminant analysis with a stochastic supervisor. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1987, v:20, n:4, pp:379-384 [Journal]
  46. Thriyambakam Krishnan, Subhas C. Nandy
    Efficiency of discriminant analysis when initial samples are classified stochastically. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1990, v:23, n:5, pp:529-537 [Journal]
  47. Thriyambakam Krishnan, Subhas C. Nandy
    Efficiency of logistic-normal stochastic supervision. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1990, v:23, n:11, pp:1275-1279 [Journal]
  48. 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]
  49. 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]
  50. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
    Dynamically maintaining the widest k-dense corridor. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:627-639 [Journal]
  51. Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya
    Monotone bipartitioning problem in a planar point set with applications to VLSI. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2002, v:7, n:2, pp:231-248 [Journal]
  52. Parthasarathi Dasgupta, A. K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
    Searching networks with unrestricted edge costs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2001, v:31, n:6, pp:497-507 [Journal]
  53. 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]

  54. Computing the straight skeleton of a monotone polygon in O(n log n) time. [Citation Graph (, )][DBLP]


  55. Recognition of Largest Empty Orthoconvex Polygon in a Point Set. [Citation Graph (, )][DBLP]


  56. New variations of the reverse facility location problem. [Citation Graph (, )][DBLP]


  57. Cluster connecting problem inside a polygon. [Citation Graph (, )][DBLP]


  58. Improved Algorithm for a Widest 1-Corner Corridor. [Citation Graph (, )][DBLP]


  59. A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. [Citation Graph (, )][DBLP]


  60. Algorithms for Computing Diffuse Reflection Paths in Polygons. [Citation Graph (, )][DBLP]


  61. Constrained minimum enclosing circle with center on a query line segment. [Citation Graph (, )][DBLP]


  62. Homogeneous 2-hop broadcast in 2D. [Citation Graph (, )][DBLP]


  63. Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location [Citation Graph (, )][DBLP]


  64. Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.460secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002