The following pages link to Subhas C. Nandy (Q407526):
Displaying 50 items.
- (Q197772) (redirect page) (← links)
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- On the number of shortest descending paths on the surface of a convex terrain (Q553957) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- The maximum distance-\(d\) independent set problem on unit disk graphs (Q777274) (← links)
- Guarding polyhedral terrain by \(k\)-watchtowers (Q777279) (← links)
- Range assignment for energy efficient broadcasting in linear radio networks (Q818149) (← links)
- Minimum consistent subset of simple graph classes (Q831758) (← links)
- Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set (Q845996) (← links)
- Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Weighted broadcast in linear radio networks (Q963352) (← links)
- A new fast heuristic for labeling points (Q987799) (← links)
- Improved algorithm for the widest empty 1-corner corridor (Q989575) (← links)
- Optimal algorithm for a special point-labeling problem (Q1029054) (← links)
- Homogeneous 2-hop broadcast in 2D (Q1037783) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- Shattering a set of objects in 2D (Q1613422) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) (Q1629944) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Minimum width color spanning annulus (Q1748988) (← links)
- Minimum spanning tree of line segments (Q1791012) (← links)
- Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- An in-place min-max priority search tree (Q1931277) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Color-spanning localized query (Q1998849) (← links)
- Acrophobic guard watchtower problem (Q2096366) (← links)
- Minimum consistent subset problem for trees (Q2140499) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- New variations of the maximum coverage facility location problem (Q2253454) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares'' (Q2285159) (← links)
- Localized query: color spanning variations (Q2326571) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Optimal covering and hitting of line segments by two axis-parallel squares (Q2412429) (← links)
- Efficient multiple-precision integer division algorithm (Q2445407) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
