#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2011

2018

- This year (4)
- Last 5 years (24)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Minati De, Gautam K. Das, Subhas C. Nandy
- CCCG
- 2011

In this note, we shall consider constant factor approximation algorithms for a variation of the discrete piercing set problem for unit disks. Here a set of points P is given; the objective is toâ€¦ (More)

- Minati De, Anil Maheshwari, Subhas C. Nandy
- ArXiv
- 2012

Given a simple polygon P consisting of n vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside P , (ii) the weak visibilityâ€¦ (More)

This paper addresses the problem of locating two facilities 11 in vertex-weighted tree/cycle/unicycle networks, where each facility can 12 fail with a given probability [16]. It is assumed that theâ€¦ (More)

- Minati De, Subhas C. Nandy, Sasanka Roy
- ArXiv
- 2012

Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-andsearch technique can be implemented where the objects are given in read-onlyâ€¦ (More)

- Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
- Int. J. Comput. Geometry Appl.
- 2013

In this paper, we consider constant factor approximation algorithms for a variant of the discrete piercing set problem for unit disks. Here a set of points P is given; the objective is to chooseâ€¦ (More)

- Carmen Monentea, Jimena Bravoa, Ana Isabel Vitasb, Leire Arbillagac, Minati De
- 2015

Carmen Monente, Jimena Bravo, Ana Isabel Vitas, Leire Arbillaga, M. Paz De 4 PeÃ±a and ConcepciÃ³n Cid 5 6 Published in Journal of Functional Foods 12, 365-374 (2015) 7 DOI: 10.1016/j.jff.2014.12.006 8â€¦ (More)

- Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
- Comput. Geom.
- 2013

One of the classic data structures for storing point sets in R is the priority search tree, introduced by McCreight in 1985. We show that this data structure can be made in-place, i.e., it can beâ€¦ (More)

- Minati De, Subhas C. Nandy, Sasanka Roy
- FSTTCS
- 2012

Asano et al. [JoCG 2011] proposed an open problem of computing the minimum enclosing circle of a set of n points in R2 given in a read-only array in sub-quadratic time. We show that Megiddoâ€™s pruneâ€¦ (More)

- Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
- CCCG
- 2017

This note is a study on the problem of maximizing the sum of area of non-overlapping disks centered at a set of given points in IR. If the points of P are placed on a straight-line, then the problemâ€¦ (More)

One of the classic data structures for storing point sets in R is the priority search tree, introduced by McCreight in 1985. We show that this data structure can be made in-place, i.e., it can beâ€¦ (More)