Search Results - "Nandy, Subhas"

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups by Dey, Sanjana, Foucaud, Florent, Nandy, Subhas C., Sen, Arunabha

“…We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite set of points P and a finite set of objects…”
Get full text

Optimization of Multi-Target Sample Preparation On-Demand With Digital Microfluidic Biochips by Poddar, Sudip, Bhattacharjee, Sukanta, Nandy, Subhas C., Chakrabarty, Krishnendu, Bhattacharya, Bhargab B.

“…Sample preparation is a fundamental preprocessing step needed in almost all biochemical assays and is conveniently automated on a microfluidic lab-on-chip. In…”
Get full text

New variations of the maximum coverage facility location problem by Bhattacharya, Bhaswar B., Nandy, Subhas C.

“…► We introduce the k-MaxCov problem, which is a new variant of the maximum coverage facility location problem. ► The objective is to place k new facilities…”
Get full text

Efficient multiple-precision integer division algorithm by Mukhopadhyay, Debapriyay, Nandy, Subhas C.

“…Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient…”
Get full text

Geometric Path Problems with Violations by Maheshwari, Anil, Nandy, Subhas C., Pattanayak, Drimit, Roy, Sasanka, Smid, Michiel

“…In this paper, we study variants of the classical geometric shortest path problem inside a simple polygon, where we allow a part of the path to go outside the…”
Get full text

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks by Dash, Dinesh, Bishnu, Arijit, Gupta, Arobinda, Nandy, Subhas C.

“…The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem…”
Get full text

Line coverage measures in wireless sensor networks by Dash, Dinesh, Gupta, Arobinda, Bishnu, Arijit, Nandy, Subhas C.

“…The coverage problem in wireless sensor networks addresses the problem of covering a region with sensors. Many different definitions of coverage are there in…”
Get full text

Approximation algorithms for maximum independent set of a unit disk graph by Das, Gautam K., De, Minati, Kolay, Sudeshna, Nandy, Subhas C., Sur-Kolay, Susmita

“…We propose a 2-approximation algorithm for the maximum independent set problem for a unit disk graph. The time and space complexities are O(n3) and O(n2),…”
Get full text

Rectilinear path problems in restricted memory setup by Bhattacharya, Binay K., De, Minati, Maheshwari, Anil, Nandy, Subhas C., Roy, Sasanka

“…We study the rectilinear path problem in the presence of disjoint axis parallel rectangular obstacles in the read-only and in-place setup. The input to the…”
Get full text

Some variations on constrained minimum enclosing circle problem by Karmakar, Arindam, Das, Sandip, Nandy, Subhas C., Bhattacharya, Binay K.

“…Given a set P of n points and a straight line L , we study three important variations of minimum enclosing circle problem as follows: Computing k identical…”
Get full text

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons by Khan, Arindam, Pal, Sudebkumar P., Aanjaneya, Mridul, Bishnu, Arijit, Nandy, Subhas C.

“…In this paper we study the diffuse reflection diameter and diffuse reflection radius problems for convex-quadrilateralizable polygons. In the usual model of…”
Get full text

Efficient algorithm for placing a given number of base stations to cover a convex region by Das, Gautam K., Das, Sandip, Nandy, Subhas C., Sinha, Bhabani P.

“…In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a…”
Get full text

Recognition of largest empty orthoconvex polygon in a point set by Nandy, Subhas C., Mukhopadhyaya, Krishnendu, Bhattacharya, Bhargab B.

“…An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points on a 2D rectangular region, is presented. The…”
Get full text

Improved algorithm for the widest empty 1-corner corridor by Das, Gautam K., Mukhopadhyay, Debapriyay, Nandy, Subhas C.

“…Given a set P of n points on a 2D plane, an empty corridor is an open region bounded by two parallel polygonal chains that does not contain any point of P, and…”
Get full text

A new fast heuristic for labeling points by Roy, Sasanka, Bhattacharjee, Subhasis, Das, Sandip, Nandy, Subhas C.

“…In the point site labeling problem, we are given a set P = { p 1 , p 2 , … , p n } of point sites in the plane. The label of a point p i is an axis-parallel…”
Get full text

Weighted broadcast in linear radio networks by Das, Gautam K., Nandy, Subhas C.

“…The weighted version of the broadcast range assignment problem in ad hoc wireless network is studied. Efficient algorithms are presented for the unbounded and…”
Get full text

Minimum consistent subset of simple graph classes by Dey, Sanjana, Maheshwari, Anil, Nandy, Subhas C.

“…In the minimum consistent subset (MCS) problem, a connected simple undirected graph G=(V,E) is given whose each vertex is colored by one of the colors…”
Get full text

Range assignment for energy efficient broadcasting in linear radio networks by Das, Gautam K., Das, Sandip, Nandy, Subhas C.

“…Given a set S of n radio-stations located on a d-dimensional space, a source node s ( ∈ S ) and an integer h ( 1 ⩽ h ⩽ n - 1 ) , the h-hop broadcast range…”
Get full text

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set by Goswami, Partha P., Das, Sandip, Nandy, Subhas C.

“…Let P be a set of n colored points distributed arbitrarily in R 2 . The chromatic distribution of the k-nearest neighbors of a query line segment ℓ is to…”
Get full text

Color-spanning localized query by Acharyya, Ankush, Maheshwari, Anil, Nandy, Subhas C.

“…Let P be a set of n points, where each point is colored with one of the k possible colors. We present efficient algorithms to preprocess P such that for a…”
Get full text