This group works on Algorithms and Data Structures, Discrete and Computational
Geometry, Low Memory Algorithms and Combinatorial Optimization.
Group Members
Journals
- D. Mondal, A. Kumar, A. Bishnu, K. Mukhopadhyaya, and S. C. Nandy,
Measuring the Quality of Surveillance in a Wireless Sensor Network,
International Journal of Foundations of Computer Science,
World Scientific, vol. 22, no. 4, pp. 983-998, 2011.
- 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,
Elsevier, vol. 9, no. 2, pp. 182-189, 2011.
Conferences
- Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid,
An In-Place Priority Search Tree,
CCCG, 2011.
- Minati De, Gautam K. Das, Subhas C. Nandy,
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks,
CCCG, 2011.
- Minati De, Subhas C. Nandy,
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D,
CCCG, 2011.
- Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das,
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line,
COCOON, 2011: 213-224.
- Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das,
Minimum Width Rectangular Annulus,
FAW-AAIM, 2011: 364-374.
- Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami,
k-Enclosing Axis-Parallel Square,
ICCSA (3), 2011: 84-93.
- Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das,
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point,
WALCOM, 2011: 98-109.
Journals
- Gautam K. Das, Sandip Das, Subhas C. Nandy,
Homogeneous 2-hop broadcast in 2D,
Comput. Geom.,
Elsevier, vol. 43, no. 2, pp. 182-190, 2010.
- Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya,
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines ,
Fundam. Inform.,
IOS Press, vol. 99, no. 3, pp. 315-324, 2010.
- Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya,
Recognition of largest empty orthoconvex polygon in a point set ,
Inf. Process. Lett.,
Elsevier, vol. 110, no. 17, pp. 746-752, 2010.
- Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy,
Approximation algorithms for shortest descending paths in terrains ,
J. Discrete Algorithms,
Elsevier, vol. 8, no. 2, pp. 214-230, 2010.
Conferences
- 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.
- Bhaswar B. Bhattacharya, Subhas C. Nandy,
New variations of the reverse facility location problem,
CCCG, 2010:241-244.
- Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami,
Cluster connecting problem inside a polygon,
CCCG, 2010:265-268.
- Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya,
Some Variations on Constrained Minimum Enclosing Circle Problem,
COCOA (1), 2010: 354-368.
- 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.
- 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.