Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. - Minati De; Gautam K. Das; Subhas C. Nandy (CCCG, 2011)

An In-Place Priority Search Tree. - Minati De; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (CCCG, 2011)

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. - Minati De; Subhas C. Nandy (CCCG, 2011)

Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle - Minati De; Subhas C. Nandy (CoRR, 2011)

Minimum Enclosing Circle with Few Extra Variables. - Minati De; Subhas C. Nandy; Sasanka Roy (FSTTCS, 2012)

Space-efficient Algorithms for Visibility Problems in Simple Polygon - Minati De; Anil Maheshwari; Subhas C. Nandy (CoRR, 2012)

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space - Minati De; Subhas C. Nandy; Sasanka Roy (CoRR, 2012)

An in-place min-max priority search tree. - Minati De; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (Comput. Geom., 2013)

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. - Minati De; Gautam K. Das; Paz Carmi; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2013)

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. - Binay K. Bhattacharya; Minati De; Tsunehiko Kameda; Sasanka Roy; Vladyslav Sokol; Zhao Song 002 (COCOON, 2014)

Facility location problems in the constant work-space read-only memory model. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CoRR, 2014)

In-place algorithms for computing a largest clique in geometric intersection graphs. - Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2014)

Approximation algorithms for maximum independent set of a unit disk graph. - Gautam K. Das; Minati De; Sudeshna Kolay; Subhas C. Nandy; Susmita Sur-Kolay (Inf. Process. Lett., 2015)

Prune-and-search with limited workspace. - Minati De; Subhas C. Nandy; Sasanka Roy (J. Comput. Syst. Sci., 2015)

Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. - Gill Barequet; Minati De (CALDAM, 2017)

Demand Hitting and Covering of Intervals. - Datta Krupa R.; Aniket Basu Roy; Minati De; Sathish Govindarajan (CALDAM, 2017)

Range Assignment of Base-Stations Maximizing Coverage Area without Interference. - Ankush Acharyya; Minati De; Subhas C. Nandy (CCCG, 2017)

Rectilinear path problems in restricted memory setup. - Binay K. Bhattacharya; Minati De; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2017)

Circular Separation Dimension of a Subclass of Planar Graphs. - Arpitha P. Bharathi; Minati De; Abhiruk Lahiri (Discret. Math. Theor. Comput. Sci., 2017)

Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. - Gill Barequet; Minati De; Michael T. Goodrich (COCOON, 2018)

Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ESA, 2018)

Guarding Polyhedral Terrain by k-Watchtowers. - Nitesh Tripathi; Manjish Pal; Minati De; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Brief Announcement: Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ICALP, 2018)

A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. - Gill Barequet; Minati De (COCOON, 2019)

Variations of largest rectangle recognition amidst a bichromatic point set. - Ankush Acharyya; Minati De; Subhas C. Nandy; Supantha Pandit (Discret. Appl. Math., 2020)

Constant work-space algorithms for facility location problems. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2020)

Range assignment of base-stations maximizing coverage area without interference. - Ankush Acharyya; Minati De; Subhas C. Nandy; Bodhayan Roy (Theor. Comput. Sci., 2020)

Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. - Gill Barequet; Minati De; Michael T. Goodrich (Algorithmica, 2021)

Online Dominating Set and Independent Set. - Minati De; Sambhav Khurana; Satyam Singh 001 (CoRR, 2021)

Hitting Geometric Objects Online via Points in $ mathbb {Z}^d$. - Minati De; Satyam Singh 001 (COCOON, 2022)

Online Piercing of Geometric Objects. - Minati De; Saksham Jain; Sarat Varma Kallepalli; Satyam Singh 001 (FSTTCS, 2022)

Online Dominating Set and Coloring. - Minati De; Sambhav Khurana; Satyam Singh 001 (COCOA (1), 2023)

Online Hitting of Unit Balls and Hypercubes in ℝs using Points from ℤd. - Minati De; Satyam Singh 001 (CoRR, 2023)

Online Geometric Hitting Set and Set Cover Beyond Unit Balls in ℝ2. - Minati De; Ratnadip Mandal; Satyam Singh 001 (CoRR, 2023)

Online Dominating Set and Coloring for Geometric Intersection Graphs. - Minati De; Sambhav Khurana; Satyam Singh 001 (CoRR, 2023)

Geometric dominating-set and set-cover via local-search. - Minati De; Abhiruk Lahiri (Comput. Geom., 2023)

Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles. - Minati De; Ratnadip Mandal; Subhas C. Nandy (CCCG, 2024)

Online class cover problem. - Minati De; Anil Maheshwari; Ratnadip Mandal (Comput. Geom., 2024)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem. - Minati De; Ratnadip Mandal; Satyam Singh 001 (CoRR, 2024)

Online Hitting Sets for Disks of Bounded Radii. - Minati De; Satyam Singh 001; Csaba D. Tóth (CoRR, 2024)

Online hitting of unit balls and hypercubes in Rd using points from Zd. - Minati De; Satyam Singh 001 (Theor. Comput. Sci., 2024)

Online Geometric Covering and Piercing. - Minati De; Saksham Jain; Sarat Varma Kallepalli; Satyam Singh 001 (Algorithmica, 2024)

Online Bichromatic Piercing Set Problem. - Minati De; Ratnadip Mandal (CIAC (2), 2025)

New Lower Bound and Algorithm for Online Geometric Hitting Set Problem. - Minati De; Ratnadip Mandal; Satyam Singh 001 (COCOON (1), 2025)