The following pages link to Giri Narasimhan (Q176423):
Displaying 44 items.
- (Q232411) (redirect page) (← links)
- LR-visibility in polygons (Q676582) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- Graph-theoretic techniques in D-optimal design problems (Q1598699) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- (Q2721991) (← links)
- (Q2748154) (← links)
- (Q2762528) (← links)
- (Q2768359) (← links)
- Geometric Avatar Problems (Q2963929) (← links)
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners (Q3149878) (← links)
- (Q3150179) (← links)
- (Q3348433) (← links)
- Geometric Spanner Networks (Q3445775) (← links)
- (Q4037425) (← links)
- A Fast Algorithm for Constructing Sparse Euclidean Spanners (Q4354006) (← links)
- (Q4418635) (← links)
- (Q4427857) (← links)
- Approximating the Stretch Factor of Euclidean Graphs (Q4507380) (← links)
- (Q4542536) (← links)
- (Q4698690) (← links)
- Balanced Partition of Minimum Spanning Trees (Q4739324) (← links)
- (Q4779120) (← links)
- BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586) (← links)
- (Q4829019) (← links)
- (Q4886051) (← links)
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS (Q4949991) (← links)
- Approximate distance oracles for geometric spanners (Q4962702) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- On hamiltonian triangulations in simple polygons (Extended Abstract) (Q5096949) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191519) (← links)
- Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions (Q5269369) (← links)
- Region-Restricted Clustering for Geographic Data Mining (Q5449545) (← links)
- Computational Science – ICCS 2005 (Q5709415) (← links)
- STACS 2005 (Q5710703) (← links)
- Algorithms and Computation (Q5897917) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- Improved algorithms for constructing fault-tolerant spanners (Q5956838) (← links)
- Differential meta-analysis for testing the relative importance of two competing null hypotheses over multiple experiments (Q6598273) (← links)
