8 citations · 17 across the 11 of their papers we have counts for
3 papers · 1 filter
A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
Sathish Govindarajan, Gabriel Nivasch
Let be a convex curve in the plane (say, the unit circle), and let be a family of planar convex bodies, such that every two of them meet at a point of . Then $\…
Vertex Cover Gets Faster and Harder on Low Degree Graphs
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set pr…
Selection Lemmas for various geometric objects
Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan
Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delauna…