The following pages link to Gautam K. Das (Q483056):
Displaying 50 items.
- (Q187122) (redirect page) (← links)
- (Q1386770) (redirect page) (← links)
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- LR-visibility in polygons (Q676582) (← 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)
- Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306) (← links)
- Weighted broadcast in linear radio networks (Q963352) (← links)
- Improved algorithm for the widest empty 1-corner corridor (Q989575) (← links)
- Homogeneous 2-hop broadcast in 2D (Q1037783) (← links)
- Minimum vertex hulls for polyhedral domains (Q1199529) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) (Q1629944) (← links)
- DRESS: dimensionality reduction for efficient sequence search (Q1715895) (← links)
- Liar's dominating set in unit disk graphs (Q1791011) (← links)
- On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Mining Chains of Relations (Q3113418) (← links)
- (Q3355260) (← links)
- IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS (Q3444849) (← 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)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Homogeneous 2-Hops Broadcast in 2D (Q3599030) (← links)
- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field (Q3603559) (← links)
- Improved Algorithm for a Widest 1-Corner Corridor (Q3605487) (← links)
- (Q4037425) (← links)
- (Q4234097) (← links)
- (Q4268440) (← links)
- A Fast Algorithm for Constructing Sparse Euclidean Spanners (Q4354006) (← links)
- (Q4547546) (← links)
- Planar spanners and approximate shortest path queries among obstacles in the plane (Q4595512) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
- (Q4698690) (← links)
- (Q4886051) (← links)
- CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES (Q4886312) (← links)
- Generating sparse spanners for weighted graphs (Q5056089) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
- Just-in-Time Analytics on Large File Systems (Q5274609) (← links)
