Priya Ranjan Sinha Mahapatra

activity

20162023

collaborators

5 papers

cs.CG2023

Maximum-Width Rainbow-Bisecting Empty Annulus

Sang Won Bae, Sandip Banerjee, Arpita Baral +2

Given a set of $n$ colored points with $k$ colors in the plane, we study the problem of computing a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-para…

cs.DS2021

Efficient Reporting of Top-k Subset Sums

Biswajit Sanyal, Subhashis Majumder, Priya Ranjan Sinha Mahapatra

The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in r…

cs.CG2018

Maximum-Width Empty Square and Rectangular Annulus

Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra

An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with…

cs.CG2017

Maximum-width Axis-Parallel Empty Rectangular Annulus

Arpita Baral, Abhilash Gondane, Sanjib Sadhu +1

Given a set $P$ of $n$ points on $R^{2}$ , we address the problem of computing an axis-parallel empty rectangular annulus $A$ of maximum-width such that no point of $P$ lies…

cs.DM2016

No-hole $λ$ - $L (k, k - 1, \dots, 2, 1)$ -labeling for Square Grid

Soumen Atta, Priya Ranjan Sinha Mahapatra, Stanisław Goldstein

Given a fixed $k$ $\in$ $Z^{+}$ and $λ$ $\in$ $Z^{+}$ , the objective of a $λ$ - $L (k, k - 1, \dots, 2, 1)$ -labeling of a graph $G$ is to assign non-negative integers (kn…