The following pages link to Sathish Govindarajan (Q396470):
Displaying 16 items.
- Small strong epsilon nets (Q396471) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- On strong centerpoints (Q483053) (← links)
- On locally Gabriel geometric graphs (Q497339) (← links)
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane (Q745667) (← links)
- Efficient external memory structures for range-aggregate queries (Q1931282) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- I/O-efficient well-separated pair decomposition and applications (Q2505500) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- (Q2753938) (← links)
- Selection Lemmas for Various Geometric Objects (Q2828788) (← links)
- (Q2857333) (← links)
- Vertex Cover Gets Faster and Harder on Low Degree Graphs (Q2920457) (← links)
- HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS (Q2939919) (← links)
- Demand Hitting and Covering of Intervals (Q2971657) (← links)
- Packing and Covering with Non-Piercing Regions (Q4606318) (← links)
