default search action
Minati De
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh:
Online Geometric Covering and Piercing. Algorithmica 86(9): 2739-2765 (2024) - [j14]Minati De, Anil Maheshwari, Ratnadip Mandal:
Online class cover problem. Comput. Geom. 123: 102120 (2024) - [j13]Minati De, Satyam Singh:
Online hitting of unit balls and hypercubes in Rd using points from Zd. Theor. Comput. Sci. 992: 114452 (2024) - [i17]Minati De, Ratnadip Mandal, Satyam Singh:
New Lower Bound and Algorithms for Online Geometric Hitting Set Problem. CoRR abs/2409.11166 (2024) - [i16]Minati De, Satyam Singh, Csaba D. Tóth:
Online Hitting Sets for Disks of Bounded Radii. CoRR abs/2412.04646 (2024) - 2023
- [j12]Minati De
, Abhiruk Lahiri:
Geometric dominating-set and set-cover via local-search. Comput. Geom. 113: 102007 (2023) - [c19]Minati De
Online Dominating Set and Coloring. COCOA (1) 2023: 68-81 - [i15]Minati De, Satyam Singh:
Online Hitting of Unit Balls and Hypercubes in ℝs using Points from ℤd. CoRR abs/2303.11779 (2023) - [i14]Minati De, Ratnadip Mandal, Satyam Singh:
Online Geometric Hitting Set and Set Cover Beyond Unit Balls in ℝ2. CoRR abs/2304.06780 (2023) - [i13]Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh:
Online Geometric Covering and Piercing. CoRR abs/2305.02445 (2023) - [i12]Minati De, Anil Maheshwari, Ratnadip Mandal:
Online Class Cover Problem. CoRR abs/2308.07020 (2023) - [i11]Minati De, Sambhav Khurana, Satyam Singh:
Online Dominating Set and Coloring for Geometric Intersection Graphs. CoRR abs/2312.01467 (2023) - 2022
- [c18]Minati De
Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$. COCOON 2022: 537-548 - [c17]Minati De
Online Piercing of Geometric Objects. FSTTCS 2022: 17:1-17:16 - 2021
- [j11]Gill Barequet, Minati De
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. Algorithmica 83(7): 2245-2272 (2021) - [i10]Minati De, Sambhav Khurana, Satyam Singh:
Online Dominating Set and Independent Set. CoRR abs/2111.07812 (2021) - 2020
- [j10]Binay K. Bhattacharya, Minati De
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020) - [j9]Ankush Acharyya
Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. 286: 35-50 (2020) - [j8]Ankush Acharyya
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804: 81-97 (2020)
2010 – 2019
- 2019
- [c16]Gill Barequet, Minati De
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. COCOON 2019: 13-24 - [i9]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR abs/1905.07124 (2019) - 2018
- [c15]Gill Barequet, Minati De
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON 2018: 130-142 - [c14]Steven Chaplick
Approximation Schemes for Geometric Coverage Problems. ESA 2018: 17:1-17:15 - [c13]Nitesh Tripathi, Manjish Pal, Minati De
Guarding Polyhedral Terrain by k-Watchtowers. FAW 2018: 112-125 - [c12]Steven Chaplick
Brief Announcement: Approximation Schemes for Geometric Coverage Problems. ICALP 2018: 107:1-107:4 - 2017
- [j7]Binay K. Bhattacharya, Minati De
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j6]Arpitha P. Bharathi, Minati De, Abhiruk Lahiri:
Circular Separation Dimension of a Subclass of Planar Graphs. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [c11]Gill Barequet, Minati De
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. CALDAM 2017: 24-36 - [c10]Datta Krupa R., Aniket Basu Roy
Demand Hitting and Covering of Intervals. CALDAM 2017: 267-280 - [c9]Ankush Acharyya, Minati De, Subhas C. Nandy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG 2017: 126-131 - [i8]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR abs/1705.09346 (2017) - 2016
- [i7]Minati De, Abhiruk Lahiri:
Geometric Dominating Set and Set Cover via Local Search. CoRR abs/1605.02499 (2016) - [i6]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. CoRR abs/1607.06665 (2016) - [i5]Arpitha P. Bharathi, Minati De, Abhiruk Lahiri:
Circular Separation Dimension of a Subclass of Planar Graphs. CoRR abs/1612.09436 (2016) - 2015
- [j5]Gautam K. Das, Minati De
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115(3): 439-446 (2015) - [j4]Minati De
Prune-and-search with limited workspace. J. Comput. Syst. Sci. 81(2): 398-414 (2015) - [c8]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - 2014
- [j3]Minati De
In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. 178: 58-70 (2014) - [c7]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014 - [c6]Binay K. Bhattacharya, Minati De
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - [i4]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Facility location problems in the constant work-space read-only memory model. CoRR abs/1409.4092 (2014) - 2013
- [j2]Minati De
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013) - [j1]Minati De
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23(6): 461- (2013) - 2012
- [c5]Minati De
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338 - [c4]Minati De
Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521 - [i3]Minati De, Anil Maheshwari, Subhas C. Nandy:
Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012) - [i2]Minati De, Subhas C. Nandy, Sasanka Roy:
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space. CoRR abs/1212.5353 (2012) - 2011
- [c3]Minati De, Gautam K. Das, Subhas C. Nandy:
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011 - [c2]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. CCCG 2011 - [c1]Minati De, Subhas C. Nandy:
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011 - [i1]Minati De, Subhas C. Nandy:
Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle. CoRR abs/1104.3076 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: