9 results on '"Nandy, Subhas C."'
Search Results
2. Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares
3. Color Spanning Objects: Algorithms and Hardness Results
4. Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
5. Partial Enclosure Range Searching.
6. Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model.
7. Variations of largest rectangle recognition amidst a bichromatic point set.
8. Color spanning objects: Algorithms and hardness results.
9. Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.