#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2007

2019

- This year (5)
- Last 5 years (27)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Esther M. Arkin, Aritra Banik, +4 authors Marina Simakov
- CCCG
- 2015

LetP =fC1;C2;:::;Cng be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at… (More)

- Esther M. Arkin, Aritra Banik, +4 authors Marina Simakov
- ISAAC
- 2015

Let \(P=\{C_1,C_2,\ldots , C_n\}\) be a set of color classes, where each color class \(C_i\) consists of a pair of objects. We focus on two problems in which the objects are points on the line. In… (More)

In this paper we consider a simplied variant of the discrete Voronoi Game in R 2 , which is also of independent interest in competitive facility location. The game consists of two players P1 and P2,… (More)

- Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
- J. Comb. Optim.
- 2013

The one-round discrete Voronoi game, with respect to a n-point user set $\mathcal {U}$, consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set $\mathcal{F}_{1}$ of m… (More)

Since its emergence in the 1990s the World Wide Web (WWW) has rapidly evolved into a huge mine of global information and it is growing in size everyday. The presence of huge amount of resources on… (More)

- Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
- CIAC
- 2017

- Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
- Algorithmica
- 2019

The input for the Geometric Coverage problem consists of a pair $$\varSigma =(P,\mathcal {R})$$ Σ = ( P , R ) , where P is a set of points in $${\mathbb {R}}^d$$ R d and $$\mathcal {R}$$ R is a set… (More)

- Esther M. Arkin, Aritra Banik, +5 authors Joseph S. B. Mitchell
- ISAAC
- 2017

Given $n$ pairs of points, $\mathcal{S} = \{\{p_1, q_1\}, \{p_2, q_2\}, \dots, \{p_n, q_n\}\}$, in some metric space, we study the problem of two-coloring the points within each pair, red and blue,… (More)

- Sayan Bandyapadhyay, Aritra Banik
- CALDAM
- 2016

In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these… (More)

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such… (More)