CRB-tree: An efficient indexing scheme for range-aggregate queries S Govindarajan, PK Agarwal, L Arge International Conference on Database Theory, 143-157, 2003 | 56 | 2003 |

Range searching in categorical data: Colored range searching on grid PK Agarwal, S Govindarajan, S Muthukrishnan European Symposium on Algorithms, 17-28, 2002 | 46 | 2002 |

Conflict-free coloring for rectangle ranges using *O*(*n*^{.382}) colorsD Ajwani, K Elbassioni, S Govindarajan, S Ray Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007 | 39 | 2007 |

A scalable simulator for forest dynamics S Govindarajan, M Dietze, PK Agarwal, J Clark Proceedings of the twentieth annual symposium on Computational geometry, 106-115, 2004 | 24 | 2004 |

A scalable algorithm for dispersing population S Govindarajan, MC Dietze, PK Agarwal, JS Clark Journal of Intelligent Information Systems 29 (1), 39-61, 2007 | 18 | 2007 |

I/O-efficient well-separated pair decomposition and its applications S Govindarajan, T Lukovszki, A Maheshwari, N Zeh European Symposium on Algorithms, 221-232, 2000 | 18 | 2000 |

Packing and covering with non-piercing regions S Govindarajan, R Raman, S Ray, A Basu Roy 24th Annual European Symposium on Algorithms (ESA 2016), 2016 | 16 | 2016 |

Packing and covering with non-piercing regions AB Roy, S Govindarajan, R Raman, S Ray Discrete & Computational Geometry 60 (2), 471-492, 2018 | 11 | 2018 |

Small strong epsilon nets P Ashok, U Azmi, S Govindarajan Computational Geometry 47 (9), 899-909, 2014 | 11 | 2014 |

Efficient external memory structures for range-aggregate queries PK Agarwal, L Arge, S Govindarajan, J Yang, K Yi Computational Geometry 46 (3), 358-370, 2013 | 11 | 2013 |

Conflict-free coloring for rectangle ranges using O (n. 382) colors D Ajwani, K Elbassioni, S Govindarajan, S Ray Discrete & Computational Geometry 48 (1), 39-52, 2012 | 10 | 2012 |

New ϵ-net constructions J Kulkarni, S Govindarajan Proceedings of the 22nd Annual Canadian Conference on Computational Geometry …, 2010 | 10 | 2010 |

I/O-efficient well-separated pair decomposition and applications S Govindarajan, T Lukovszki, A Maheshwari, N Zeh Algorithmica 45 (4), 585-614, 2006 | 7 | 2006 |

A Variant of the Hadwiger–Debrunner (*p*, *q*)-Problem in the PlaneS Govindarajan, G Nivasch Discrete & Computational Geometry 54 (3), 637-646, 2015 | 6 | 2015 |

Hitting and piercing rectangles induced by a point set N Rajgopal, P Ashok, S Govindarajan, A Khopkar, N Misra International Computing and Combinatorics Conference, 221-232, 2013 | 6 | 2013 |

Fluid Dynamics and Heat Transfer Considerations in Tata Steel's Six-Strand Billet Caster S Govindarajan, R Dutta, A Chatterjee IISC. The Sixth International Iron and Steel Congress. 3, 197-206, 1990 | 6 | 1990 |

Demand hitting and covering of intervals AB Roy, M De, S Govindarajan Conference on Algorithms and Discrete Applied Mathematics, 267-280, 2017 | 3 | 2017 |

Selection lemmas for various geometric objects P Ashok, S Govindarajan, N Rajgopal International Journal of Computational Geometry & Applications 26 (02), 67-87, 2016 | 3 | 2016 |

Local search strikes again: PTAS for variants of geometric covering and packing P Ashok, AB Roy, S Govindarajan Journal of Combinatorial Optimization 39 (2), 618-635, 2020 | 2 | 2020 |

On locally gabriel geometric graphs S Govindarajan, A Khopkar Graphs and Combinatorics 31 (5), 1437-1452, 2015 | 2 | 2015 |