The following pages link to Minati De (Q473191):
Displaying 27 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Guarding polyhedral terrain by \(k\)-watchtowers (Q777279) (← links)
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
- An in-place min-max priority search tree (Q1931277) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- A lower bound on the growth constant of polyaboloes on the Tetrakis lattice (Q2300025) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs (Q2898007) (← links)
- Back-Up 2-Center on a Path/Tree/Cycle/Unicycle (Q2920478) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Minimum enclosing circle with few extra variables (Q2957525) (← links)
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function (Q2971631) (← links)
- Demand Hitting and Covering of Intervals (Q2971657) (← links)
- Circular Separation Dimension of a Subclass of Planar Graphs (Q4560209) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)
- Rectilinear Path Problems in Restricted Memory Setup (Q5174950) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)
- Online class cover problem (Q6600810) (← links)
- Online dominating set and coloring (Q6606165) (← links)
- Online geometric covering and piercing (Q6614105) (← links)
