Subhas C. Nandy Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013)
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy: Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discrete Applied Mathematics 161(10-11): 1496-1505 (2013)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bhaswar B. Bhattacharya, Subhas C. Nandy: New variations of the maximum coverage facility location problem. European Journal of Operational Research 224(3): 477-485 (2013)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2012
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Sandeep Sen: Preface. Theor. Comput. Sci. 442: 1 (2012)
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for computing diffuse reflection paths in polygons. The Visual Computer 28(12): 1229-1237 (2012)
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Subhas C. Nandy, Sasanka Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS 2012: 1-10
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Subhas C. Nandy, Sasanka Roy: Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN 2012: 214-217
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Anil Maheshwari, Subhas C. Nandy: Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy: Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles. CoRR abs/1212.0640 (2012)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Subhas C. Nandy, Sasanka Roy: Convex Hull and Linear Programming in Read-only Setup with Limited Work-space. CoRR abs/1212.5353 (2012)
2011
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy: Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. 22(4): 983-998 (2011)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Gautam K. Das, Subhas C. Nandy: Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Subhas C. Nandy: Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Minati De, Subhas C. Nandy: Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle. CoRR abs/1104.3076 (2011)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)
2010
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Inform. 99(3): 315-324 (2010)
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Recognition of largest empty orthoconvex polygon in a point set. Inf. Process. Lett. 110(17): 746-752 (2010)
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao: Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bhaswar B. Bhattacharya, Subhas C. Nandy: New variations of the reverse facility location problem. CCCG 2010: 241-244
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami: Cluster connecting problem inside a polygon. CCCG 2010: 265-268
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy: Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network. CoRR abs/1006.2955 (2010)
2009
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest Color-Spanning Object Revisited. Int. J. Comput. Geometry Appl. 19(5): 457-478 (2009)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. 109(18): 1060-1065 (2009)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92
2008
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Subhas C. Nandy: Weighted broadcast in linear radio networks. Inf. Process. Lett. 106(4): 136-143 (2008)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008)
c33no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 2008
2007
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. 18(3): 619-635 (2007)
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Subhas C. Nandy: Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
c27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy: Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty: Hot Spots and Zones in a Chip: A Geometrician's View. VLSI Design 2005: 691-696
2004
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. Journal of Circuits, Systems, and Computers 13(5): 1019-1038 (2004)
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM 2004: 1051-1055
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC 2004: 412-423
2003
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Bhargab B. Bhattacharya: On finding an empty staircase polygon of largest area (width) in a planar point-set. Comput. Geom. 26(2): 143-171 (2003)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jeet Chaudhuri, Subhas C. Nandy, Sandip Das: Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy: Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama: Shattering a set of objects in 2D. Discrete Applied Mathematics 122(1-3): 183-194 (2002)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya: Monotone bipartitioning problem in a planar point set with applications to VLSI. ACM Trans. Design Autom. Electr. Syst. 7(2): 231-248 (2002)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
2001
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Searching networks with unrestricted edge costs. IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(6): 497-507 (2001)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy: Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. ISCAS (5) 2001: 395-398
2000
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera: Safety Zone Problem. J. Algorithms 37(2): 538-569 (2000)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically Maintaining the Widest k -Dense Corridor. CIAC 2000: 187-198
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy: An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. COCOON 2000: 281-290
1999
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy: Shattering a set of objects in 2d. CCCG 1999
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jeet Chaudhuri, Subhas C. Nandy: Generalized Shooter Location Problem. COCOON 1999: 389-399
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jeet Chaudhuri, Subhas C. Nandy: Largest Empty Rectangle among a Point Set. FSTTCS 1999: 34-46
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya: High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
1998
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Pinaki Mitra, Subhas C. Nandy: Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. J. Algorithms 28(2): 315-338 (1998)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya: Partitioning VLSI Floorplans by Staircase Channels for Global Routing. VLSI Design 1998: 59-64
1996
c5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya: Shooter Location Problem. CCCG 1996: 93-98
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Pinaki Mitra, Subhas C. Nandy: Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. FSTTCS 1996: 76-87
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Geometric bipartitioning problem and its applications to VLSI. VLSI Design 1996: 400-405
1994
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya: Location of the Largest Empty Rectangle among Arbitrary Obstacles. FSTTCS 1994: 159-170
1990
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thriyambakam Krishnan, Subhas C. Nandy: Efficiency of discriminant analysis when initial samples are classified stochastically. Pattern Recognition 23(5): 529-537 (1990)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thriyambakam Krishnan, Subhas C. Nandy: Efficiency of logistic-normal stochastic supervision. Pattern Recognition 23(11): 1275-1279 (1990)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray: Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS 1990: 255-269
1987
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
T. Krishnan, Subhas C. Nandy: Discriminant analysis with a stochastic supervisor. Pattern Recognition 20(4): 379-384 (1987)

Coauthor Index

1Mridul Aanjaneya
[j41]
2Mustaq Ahmed
[j35]
3Boris Aronov
[j24] [c18]
4Tetsuo Asano
[j24] [c18] [j10] [j9] [j7] [c12]
5John Augustine
[j42] [i3] [i2]
6Pritha Banerjee
[j27] [c27]
7Subhasis Bhattacharjee
[j29] [j27] [c28] [c27]
8Bhargab B. Bhattacharya
[j33] [j32] [c36] [c33] [j19] [c23] [j14] [j13] [c16] [j8] [j6] [c13] [j5] [c7] [c6] [c5] [c3] [c2] [c1]
9Bhaswar B. Bhattacharya
[j40] [c39]
10Binay K. Bhattacharya
[j39] [c37]
11Arijit Bishnu
[j41] [c46] [c44] [j36] [c38] [c36] [i1] [j27] [j19] [c16]
12B. Chakraborty
[c23]
13Jeet Chaudhuri
[j12] [c9] [c8]
14Gautam K. Das
[c43] [j34] [c40] [j28] [c34] [j26] [j25] [j22] [c32] [j20] [j18] [c31] [c30] [c25] [c21] [c20] [c17]
15Sandip Das
[j42] [j39] [i3] [j34] [c37] [c36] [i2] [j31] [j30] [j29] [j27] [j26] [j23] [j21] [c32] [j20] [j19] [j18] [c30] [c29] [j17] [c28] [c27] [c26] [c25] [c24] [j16] [j15] [c22] [c20] [c19] [j12] [j11] [c16] [c15] [c14] [c7]
16Parthasarathi Dasgupta (P. S. Dasgupta)
[j8] [j6] [c3]
17Dinesh Dash
[c46] [c44] [i1]
18Minati De
[j43] [c47] [c45] [i7] [i5] [c43] [c42] [c41] [i4]
19Anirban Ghosh
[i6]
20Sasthi C. Ghosh
[j22] [c21] [c17]
21Subir Kumar Ghosh
[j37] [c35]
22Partha P. Goswami
[j37] [c38] [j30] [c35] [j21] [j17] [c26] [j16] [j15] [c22] [j11] [c15] [c14]
23Arobinda Gupta
[c46] [c44] [i1]
24Tomohiro Harayama
[j9] [j7] [c12]
25Antonio Hernández-Barrera
[j10] [j5]
26Arindam Karmakar
[j39] [c37] [j31] [c29]
27Arindam Khan
[j41]
28Yosuke Kikuchi
[j24] [c18]
29T. Krishnan
[j1]
30Thriyambakam Krishnan
[j3] [j2]
31Abhay Kumar
[j36]
32Anil Maheshwari
[j43] [j42] [j37] [i7] [j35] [c42] [i3] [i2] [c35]
33Subhashis Majumder
[j33] [c23] [j14] [c13] [c6]
34Ritankar Mandal
[i6]
35Pinaki Mitra
[j4] [c4]
36Debashis Mondal
[j36]
37Asish Mukhopadhyay
[c40]
38Debapriyay Mukhopadhyay
[j28] [c34]
39Krishnendu Mukhopadhyaya
[j36] [j32] [c33] [c5]
40Sudebkumar Prasant Pal
[j41] [j37] [c35]
41Peichen Pan
[j8]
42Sangameswar Patil
[c40]
43S. V. Rao
[c40]
44Sibabrata Ray
[c1]
45Sasanka Roy
[j42] [c47] [c45] [i6] [i5] [j35] [i3] [i2] [j31] [j29] [j26] [j23] [c32] [c29] [c28] [c24] [j15] [c19] [c14]
46Sanjib Sadhu
[c38]
47Swami Sarvattomananda
[j42] [j37] [i3] [i2] [c35]
48Shinji Sasahara
[j24] [c18]
49Anup K. Sen
[j6] [c3]
50Sandeep Sen
[j38]
51Arani Sinha
[c2]
52Bhabani P. Sinha
[j20] [c25]
53Michiel H. M. Smid
[j43] [c42]
54Susmita Sur-Kolay
[j27] [c27] [c23] [c13]
55Takeaki Uno
[j24] [c18]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Fri May 24 11:32:51 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page