Minati De - RankMe

59 papers A* 1A 2B 1Misc 5Journal 35Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Online dominating set and coloring for geometric intersection graphs. Comput. Geom. Minati De, Sambhav Khurana, Satyam Singh
2026	J	`jnl`	Online geometric hitting set using points in Z d. Theor. Comput. Sci. Minati De, Ratnadip Mandal, Satyam Singh
2026	J	`jnl`	Set cover, hitting set, and independent set problems for some restricted classes of geometric objects. Theor. Comput. Sci. Minati De, Ratnadip Mandal, Subhas C. Nandy
2025	—	`conf`	New Lower Bound and Algorithm for Online Geometric Hitting Set Problem. COCOON (1) Minati De, Ratnadip Mandal, Satyam Singh
2025	—	`conf`	Online Bichromatic Piercing Set Problem. CIAC (2) Minati De, Ratnadip Mandal
2025	J	`jnl`	Online Hitting Set for Axis-Aligned Squares. CoRR Minati De, Satyam Singh, Csaba D. Tóth
2025	A	`conf`	Online Hitting Sets for Disks of Bounded Radii. ESA Minati De, Satyam Singh, Csaba D. Tóth
2025	B	`conf`	The Online Piercing Set Problem with Recourse. WAOA Riju Bindua, Minati De, Naveen Garg, Kanav Singla
2024	J	`jnl`	New Lower Bound and Algorithms for Online Geometric Hitting Set Problem. CoRR Minati De, Ratnadip Mandal, Satyam Singh
2024	J	`jnl`	Online Geometric Covering and Piercing. Algorithmica Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh
2024	J	`jnl`	Online Hitting Sets for Disks of Bounded Radii. CoRR Minati De, Satyam Singh, Csaba D. Tóth
2024	J	`jnl`	Online class cover problem. Comput. Geom. Minati De, Anil Maheshwari, Ratnadip Mandal
2024	J	`jnl`	Online hitting of unit balls and hypercubes in Rd using points from Zd. Theor. Comput. Sci. Minati De, Satyam Singh
2024	—	`conf`	Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles. CCCG Minati De, Ratnadip Mandal, Subhas C. Nandy
2023	J	`jnl`	Geometric dominating-set and set-cover via local-search. Comput. Geom. Minati De, Abhiruk Lahiri
2023	J	`jnl`	Online Class Cover Problem. CoRR Minati De, Anil Maheshwari, Ratnadip Mandal
2023	J	`jnl`	Online Dominating Set and Coloring for Geometric Intersection Graphs. CoRR Minati De, Sambhav Khurana, Satyam Singh
2023	—	`conf`	Online Dominating Set and Coloring. COCOA (1) Minati De, Sambhav Khurana, Satyam Singh
2023	J	`jnl`	Online Geometric Covering and Piercing. CoRR Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh
2023	J	`jnl`	Online Hitting of Unit Balls and Hypercubes in ℝ CoRR Minati De, Satyam Singh
2022	Misc	`conf`	Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$. COCOON Minati De, Satyam Singh
2022	—	`conf`	Online Piercing of Geometric Objects. FSTTCS Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh
2021	J	`jnl`	Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. Algorithmica Gill Barequet, Minati De, Michael T. Goodrich
2021	J	`jnl`	Online Dominating Set and Independent Set. CoRR Minati De, Sambhav Khurana, Satyam Singh
2020	J	`jnl`	Constant work-space algorithms for facility location problems. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2020	J	`jnl`	Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2020	J	`jnl`	Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
2019	Misc	`conf`	A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. COCOON Gill Barequet, Minati De
2019	J	`jnl`	Variations of largest rectangle recognition amidst a bichromatic point set. CoRR Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
2018	A	`conf`	Approximation Schemes for Geometric Coverage Problems. ESA Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2018	A*	`conf`	Brief Announcement: Approximation Schemes for Geometric Coverage Problems. ICALP Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2018	Misc	`conf`	Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON Gill Barequet, Minati De, Michael T. Goodrich
2018	Misc	`conf`	Guarding Polyhedral Terrain by k-Watchtowers. FAW Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy
2017	J	`jnl`	Circular Separation Dimension of a Subclass of Planar Graphs. Discret. Math. Theor. Comput. Sci. Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
2017	—	`conf`	Demand Hitting and Covering of Intervals. CALDAM Datta Krupa R., Aniket Basu Roy, Minati De, Sathish Govindarajan
2017	—	`conf`	Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG Ankush Acharyya, Minati De, Subhas C. Nandy
2017	J	`jnl`	Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2017	J	`jnl`	Rectilinear path problems in restricted memory setup. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2017	—	`conf`	Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. CALDAM Gill Barequet, Minati De
2016	J	`jnl`	Approximation Schemes for Geometric Coverage Problems. CoRR Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2016	J	`jnl`	Circular Separation Dimension of a Subclass of Planar Graphs. CoRR Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
2016	J	`jnl`	Geometric Dominating Set and Set Cover via Local Search. CoRR Minati De, Abhiruk Lahiri
2015	J	`jnl`	Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay
2015	J	`jnl`	Prune-and-search with limited workspace. J. Comput. Syst. Sci. Minati De, Subhas C. Nandy, Sasanka Roy
2015	—	`conf`	Rectilinear Path Problems in Restricted Memory Setup. CALDAM Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2014	Misc	`conf`	Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
2014	J	`jnl`	Facility location problems in the constant work-space read-only memory model. CoRR Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2014	J	`jnl`	In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. Minati De, Subhas C. Nandy, Sasanka Roy
2014	—	`conf`	Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2013	J	`jnl`	An in-place min-max priority search tree. Comput. Geom. Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2013	J	`jnl`	Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
2012	J	`jnl`	Convex Hull and Linear Programming in Read-only Setup with Limited Work-space CoRR Minati De, Subhas C. Nandy, Sasanka Roy
2012	—	`conf`	In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM Minati De, Subhas C. Nandy, Sasanka Roy
2012	—	`conf`	Minimum Enclosing Circle with Few Extra Variables. FSTTCS Minati De, Subhas C. Nandy, Sasanka Roy
2012	J	`jnl`	Space-efficient Algorithms for Visibility Problems in Simple Polygon CoRR Minati De, Anil Maheshwari, Subhas C. Nandy
2011	—	`conf`	An In-Place Priority Search Tree. CCCG Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011	—	`conf`	Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG Minati De, Gautam K. Das, Subhas C. Nandy
2011	J	`jnl`	Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle CoRR Minati De, Subhas C. Nandy
2011	—	`conf`	Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG Minati De, Subhas C. Nandy