Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Minati De
2010 – today
- 2013
[j1]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013)- 2012
[c5]Minati De, Subhas C. Nandy, Sasanka Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338
[c4]Minati De, Subhas C. Nandy, Sasanka Roy: 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)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-03 22:06 CET by the dblp team



