Employment
-
National Institute of Technology Durgapur
Education
Education history is unavailable.
Projects & Funding
Projects & funding information is unavailable.
Publications (11)
- Computation of Geometric Color-Spanning Region for Line Segments Save
- Geometric objects covering all red points and minimum blue points Save
- Discrete and mixed two-center problems for line segments Save
- Arbitrary-Oriented Color Spanning Region for Line Segments Save
- Red-Blue Rectangular Annulus Cover Problem Save
- Color-Spanning Problem for Line Segments Save
- Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon Save
- Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares” [Theor. Comput. Sci. 769 (2019) 63–74] Save
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares Save
- Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model Save