S. Nandy

发表

Partial Enclosure Range Searching ∗

M. Smid, Gregory Bint, A. Maheswari, 2015 .

FPGA placement using space-filling curves: Theory meets practice

Sandip Das, Pritha Banerjee, S. Sur-Kolay, 2009, TECS.

Acrophobic guard watchtower problem

S. Nandy, Anil S. Maheshwari, Ritesh Seth, 2022, Comput. Geom..

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups

Florent Foucaud, S. Nandy, Sanjana Dey, 2020, Algorithmica.

The Euclidean k-supplier problem in IR2

Subhas C. Nandy, Manjanna Basappa, Ramesh K. Jallu, 2021, Oper. Res. Lett..

The Euclidean k-Supplier Problem in

Subhas C. Nandy, Gautam K. Das, Manjanna Basappa, 2016, ALGOSENSORS.

Simple algorithms for partial point set pattern matching under rigid motion

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya, 2006, Pattern Recognit..

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya, 2003, CIAC.

Smallest k-point enclosing rectangle and square of arbitrary orientation

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2005, Inf. Process. Lett..

Dynamically maintaining the widest k-dense corridor

Tetsuo Asano, Subhas C. Nandy, Tomohiro Harayama, 2001, Theor. Comput. Sci..

Efficient algorithms for single- and two-layer linear placement of parallel graphs

Subhas C. Nandy, Bhargab B. Bhattacharya, B. Bhattacharya, 1997 .

Range Assignment Problem in Wireless Network

Sandip Das, Subhas C. Nandy, Gautam K. Das, 2008 .

Efficiency of discriminant analysis when initial samples are classified stochastically

Subhas C. Nandy, Thriyambakam Krishnan, T. Krishnan, 1990, Pattern Recognit..

Smallest Color-Spanning Object Revisited

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2009, Int. J. Comput. Geom. Appl..

Classification of the granites of Bihar Mica Belt, Eastern India, using stepwise multigroup discriminant analysis and cluster analysis

A. Saha, S. Sarkar, Amita Chatterjee, 1988 .

An efficient k nearest neighbors searching algorithm for a query line

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2003, Theor. Comput. Sci..

Minimum Dominating Set Problem for Unit Disks Revisited

Paz Carmi, Subhas C. Nandy, Prajwal R. Prasad, 2015, Int. J. Comput. Geom. Appl..

Sparsity of weighted networks: measures and applications

A. Das, S. Nandy, Swati Goswami, 2020, Inf. Sci..

Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles pdf

Sasanka Roy, Subhas C. Nandy, Anirban Ghosh, 2012, ArXiv.

On finding an empty staircase polygon of largest area (width) in a planar point-set

Subhas C. Nandy, Bhargab B. Bhattacharya, B. Bhattacharya, 2003, Comput. Geom..

Optimal algorithm for a special point-labeling problem

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2002, Inf. Process. Lett..

Monotone bipartitioning problem in a planar point set with applications to VLSI

Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, 2002, TODE.

Searching networks with unrestricted edge costs

Parthasarathi Dasgupta, Subhas C. Nandy, Bhargab B. Bhattacharya, 2001, IEEE Trans. Syst. Man Cybern. Part A.

Geometric bipartitioning problem and its applications to VLSI

B.B. Bhattacharya, P.S. Dasgupta, A.K. Sen, 1996, Proceedings of 9th International Conference on VLSI Design.

A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids

Subhas C. Nandy, Bhargab B. Bhattacharya, B. Bhattacharya, 1995 .

Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design

Bhargab B Bhattacharya, Sibabrata Ray, Subhas C Nandy, 1990, FSTTCS.

Variations of largest rectangle recognition amidst a bichromatic point set pdf

Subhas C. Nandy, Supantha Pandit, Minati De, 2019, Discret. Appl. Math..

Querying for the Largest Empty Geometric Object in a Desired Location

John Augustine, Anil Maheshwari, Sandip Das, 2010, 1004.0558.

Generalized Shooter Location Problem

Subhas C. Nandy, Jeet Chaudhuri, S. Nandy, 1999, COCOON.

Localized geometric query problems

John Augustine, Anil Maheshwari, Sandip Das, 2011, Comput. Geom..

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks

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

Space-efficient Algorithms for Visibility Problems in Simple Polygon pdf

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

Some variations on constrained minimum enclosing circle problem

Sandip Das, Arindam Karmakar, Subhas C. Nandy, 2010, J. Comb. Optim..

Recognition of largest empty orthoconvex polygon in a point set

Subhas C. Nandy, Bhargab B. Bhattacharya, Krishnendu Mukhopadhyaya, 2010, Inf. Process. Lett..

A Generalization of Magic Squares with Applications to Digital Halftoning

Boris Aronov, Takeaki Uno, Tetsuo Asano, 2004, Theory of Computing Systems.

An in-place min-max priority search tree

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

Range Assignment of Base-Stations Maximizing Coverage Area without Interference

Subhas C. Nandy, Minati De, Ankush Acharyya, 2017, CCCG.

Approximation algorithms for maximum independent set of a unit disk graph

Susmita Sur-Kolay, Sudeshna Kolay, Subhas C. Nandy, 2015, Inf. Process. Lett..

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks

Paz Carmi, Subhas C. Nandy, Minati De, 2013, Int. J. Comput. Geom. Appl..

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

D. Dash, Arijit Bishnu, Arobinda Gupta, 2012, Wireless Networks.

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Arobinda Gupta, Dinesh Dash, Subhas C. Nandy, 2012, 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012).

Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network pdf

Arobinda Gupta, Dinesh Dash, Subhas C. Nandy, 2010, ArXiv.

The Runaway Rectangle Escape Problem pdf

Anil Maheshwari, Subhas C. Nandy, Sathish Govindarajan, 2016, ArXiv.

Line coverage measures in wireless sensor networks

Arobinda Gupta, Dinesh Dash, Subhas C. Nandy, 2014, J. Parallel Distributed Comput..

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model

Amit Chakrabarti, Subhas C. Nandy, Arijit Bishnu, 2015, FSTTCS.

In-place algorithms for computing a largest clique in geometric intersection graphs

Sasanka Roy, Subhas C. Nandy, Minati De, 2012, Discret. Appl. Math..

Faster approximation for maximum independent set on unit disk graph pdf

Sasanka Roy, Subhas C. Nandy, Supantha Pandit, 2016, Inf. Process. Lett..

Covering Segments with Unit Squares

Sasanka Roy, Subhas C. Nandy, Supantha Pandit, 2016, WADS.

Weighted broadcast in linear radio networks

Subhas C. Nandy, Gautam K. Das, G. Das, 2006, Inf. Process. Lett..

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space pdf

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

Cluster analysis revisited : a case study from Bihar Mica Belt granites, Eastern India

Subhas C. Nandy, Amita Chatterjee, S. S. Sarkar, 1989 .

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

Sudebkumar Prasant Pal, Subhas C. Nandy, Arijit Bishnu, 2013, Discret. Appl. Math..

Hot spots and zones in a chip: a geometrician's view

Susmita Sur-Kolay, Subhas C. Nandy, Subhashis Majumder, 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

Shortest monotone descent path problem in polyhedral terrain

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2005, Comput. Geom..

Discriminating Codes in Geometric Setups pdf

Arunabha Sen, Florent Foucaud, Sanjana Dey, 2020, ISAAC.

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle pdf

Sasanka Roy, Subhas C. Nandy, Ankush Acharyya, 2016, ArXiv.

Approximation algorithms for the two-center problem of convex polygon pdf

Anil Maheshwari, Sasanka Roy, Subhas C. Nandy, 2015, ArXiv.

On the number of shortest descending paths on the surface of a convex terrain

Anil Maheshwari, Sasanka Roy, Subhas C. Nandy, 2011, J. Discrete Algorithms.

An In-Place Priority Search Tree

M. Smid, A. Maheshwari, Minati De, 2011, Canadian Conference on Computational Geometry.

Geometric Path Problems with Violations

Michiel H. M. Smid, Anil Maheshwari, Sasanka Roy, 2018, Algorithmica.