The following pages link to Subhas C. Nandy (Q407526):
Displaying 50 items.
- A generalization of magic squares with applications to digital halftoning (Q2480747) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
- (Q2728901) (← links)
- (Q2766837) (← links)
- Color Spanning Objects: Algorithms and Hardness Results (Q2795933) (← links)
- Minimum Width Color Spanning Annulus (Q2817884) (← links)
- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs (Q2898007) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- (Q2957525) (← links)
- MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK (Q3016229) (← links)
- (Q3046479) (← links)
- (Q3046483) (← links)
- Some Variations on Constrained Minimum Enclosing Circle Problem (Q3066170) (← links)
- (Q3359799) (← links)
- A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion (Q3404433) (← links)
- IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS (Q3444849) (← links)
- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs (Q3449806) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
- Homogeneous 2-Hops Broadcast in 2D (Q3599030) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Improved Algorithm for a Widest 1-Corner Corridor (Q3605487) (← links)
- SMALLEST COLOR-SPANNING OBJECT REVISITED (Q3647618) (← links)
- Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles (Q4209268) (← links)
- Largest empty rectangle among a point set (Q4419481) (← links)
- (Q4437495) (← links)
- (Q4470502) (← links)
- Safety Zone Problem (Q4521529) (← links)
- Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines (Q4932067) (← links)
- Rectilinear Path Problems in Restricted Memory Setup (Q5174950) (← links)
- Partial Enclosure Range Searching (Q5234042) (← links)
- On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model (Q5275378) (← links)
- Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model (Q5379895) (← links)
- Weighted Broadcast in Linear Radio Networks (Q5434412) (← links)
- Distributed Computing - IWDC 2004 (Q5465905) (← links)
- Distributed Computing – IWDC 2005 (Q5491766) (← links)
- STACS 2005 (Q5710682) (← links)
- Algorithms and Computation (Q5712101) (← links)
- Constrained Minimum Enclosing Circle with Center on a Query Line Segment (Q5756677) (← links)
- Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon (Q5859625) (← links)
- Covering segments with unit squares (Q5894547) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901265) (← links)
- Dynamically maintaining the widest \(k\)-dense corridor (Q5941092) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Sparsity of weighted networks: measures and applications (Q6087519) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- Minimum consistent subset of simple graph classes (Q6110615) (← links)
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles (Q6567758) (← links)
- Half-guarding weakly-visible polygons and terrains (Q6604625) (← links)
