- Optimally computing a shortest weakly visible line segment inside a simple polygon ?
- CCCG 2009, Vancouver, BC, August 1719, 2009 Generalized jewels and the point placement problem
- Robust Implementation of a Convex Polygon Stabber for a Set of Isothetic Line Segments
- Closest-point queries for complex objects Eugene Greene
- A streaming algorithm for computing an approximate minimum spanning ellipse
- The Ordinary Line Problem Revisited Asish Mukhopadhyay
- CCCG 2009, Vancouver, BC, August 1719, 2009 A note on the approximation ratio for computing an approximate spanning
- A short note on monotone matrices and the sum selection problem Asish Mukhopadhyay and Eugene Greene
- Approximate minimum spanning ellipse in the streaming model Asish Mukhopadhyay
- An RNG-based heuristic for curve reconstruction Asish Mukhopadhyay
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- CCCG 2009, Vancouver, BC, August 1719, 2009 Streaming 1-Center with Outliers in High Dimensions
- Multi-gene linear separability of gene expression data in linear time
- CCCG 2010, Winnipeg MB, August 911, 2010 A new algorithm and improved lower bound for point placement on a line in
- Improved Approximation Algorithms for Agreement Forests
- A New Profiling Tool for Gene Expression Satish Ch. Panigrahi, Md. Shafiul Alam, Asish Mukhopadhyay