Sathish Govindarajan

According to our database, Sathish Govindarajan authored at least 31 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Improved Algorithms for Minimum-Membership Geometric Set Cover.

Sathish Govindarajan, Siddhartha Sarkar

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2020

Local search strikes again: PTAS for variants of geometric covering and packing.

Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan

J. Comb. Optim., 2020

Preface: CALDAM 2016.

Sathish Govindarajan, Anil Maheshwari

Discret. Appl. Math., 2020

2018

Packing and Covering with Non-Piercing Regions.

Aniket Basu Roy, Sathish Govindarajan, Rajiv Raman, Saurabh Ray

Discret. Comput. Geom., 2018

2017

Demand Hitting and Covering of Intervals.

Datta Krupa R., Aniket Basu Roy, Minati De, Sathish Govindarajan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Selection Lemmas for Various Geometric Objects.

Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal

Int. J. Comput. Geom. Appl., 2016

The Runaway Rectangle Escape Problem.

Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty

CoRR, 2016

2015

On strong centerpoints.

Pradeesha Ashok, Sathish Govindarajan

Inf. Process. Lett., 2015

On Locally Gabriel Geometric Graphs.

Sathish Govindarajan, Abhijeet Khopkar

Graphs Comb., 2015

A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane.

Sathish Govindarajan, Gabriel Nivasch

Discret. Comput. Geom., 2015

2014

Hardness Results for Computing Optimal Locally Gabriel graphs.

Abhijeet Khopkar, Sathish Govindarajan

Int. J. Comput. Geom. Appl., 2014

Small strong epsilon nets.

Pradeesha Ashok, Umair Azmi, Sathish Govindarajan

Comput. Geom., 2014

Vertex Cover Gets Faster and Harder on Low Degree Graphs.

Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

On the d-Runaway Rectangle Escape Problem.

Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Two player game variant of the Erdős-Szekeres problem.

Parikshit Kolipaka, Sathish Govindarajan

Discret. Math. Theor. Comput. Sci., 2013

Geometric graphs on convex point sets.

Abhijeet Khopkar, Sathish Govindarajan

CoRR, 2013

Efficient external memory structures for range-aggregate queries.

Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi

Comput. Geom., 2013

Hitting and Piercing Rectangles Induced by a Point Set.

Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors.

Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray

Discret. Comput. Geom., 2012

On Piercing (Pseudo)Lines and Boxes.

B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

On the Erdos-Szekeres n-interior point problem.

B. V. Subramanya Bharadwaj, Sathish Govindarajan, Karmveer Sharma

Electron. Notes Discret. Math., 2011

On Computing Optimal Locally Gabriel Graphs

Abhijeet Khopkar, Sathish Govindarajan

CoRR, 2011

2010

New epsilon-net constructions.

Janardhan Kulkarni, Sathish Govindarajan

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Small strong epsilon nets.

Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2007

A scalable algorithm for dispersing population.

Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark

J. Intell. Inf. Syst., 2007

Conflict-free coloring for rectangle ranges using <i>O</i>(<i>n</i>^.382) colors.

Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006

I/O-Efficient Well-Separated Pair Decomposition and Applications.

Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh

Algorithmica, 2006

2004

A scalable simulator for forest dynamics.

Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries.

Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge

Proceedings of the Database Theory, 2003

2002

Range Searching in Categorical Data: Colored Range Searching on Grid.

Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan

Proceedings of the Algorithms, 2002

2000

I/O-Efficient Well-Separated Pair Decomposition and Its Applications.

Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh

Proceedings of the Algorithms, 2000