The following pages link to Sandip Das (Q299088):
Displaying 50 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- On oriented relative clique number (Q324737) (← links)
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice (Q324981) (← links)
- Optimal strategies for the one-round discrete Voronoi game on a line (Q386423) (← links)
- Minimum-width rectangular annulus (Q388105) (← links)
- On pseudo-convex partitions of a planar point set (Q389454) (← links)
- Minimum enclosing circle of a set of fixed points and a mobile point (Q396467) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Voronoi game on graphs (Q476871) (← links)
- On representing a simple polygon perceivable to a blind person (Q506157) (← links)
- A lower bound technique for radio \(k\)-coloring (Q512555) (← links)
- Range assignment for energy efficient broadcasting in linear radio networks (Q818149) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
- On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← 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)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Fast computation of smallest enclosing circle with center on a query line segment (Q975487) (← links)
- A new fast heuristic for labeling points (Q987799) (← links)
- Covering a set of points in a plane using two parallel rectangles (Q989524) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← 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)
- The discrete Voronoi game in \(\mathbb{R}^2\) (Q1616243) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- A study on oriented relative clique number (Q1752681) (← 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)
- Localized geometric query problems (Q1931281) (← links)
- Holes or empty pseudo-triangles in planar point sets (Q1937360) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Oriented bipartite graphs and the Goldbach graph (Q2037582) (← links)
- Voronoi game on polygons (Q2044961) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- On fractional version of oriented coloring (Q2143042) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Relative clique number of planar signed graphs (Q2181247) (← links)
- Optimizing movement in convex and non-convex path-networks to establish connectivity (Q2201771) (← links)
