| CRB-tree: An efficient indexing scheme for range-aggregate queries S Govindarajan, PK Agarwal, L Arge International Conference on Database Theory, 143-157, 2002 | 62 | 2002 |
| Range searching in categorical data: Colored range searching on grid PK Agarwal, S Govindarajan, S Muthukrishnan European Symposium on Algorithms, 17-28, 2002 | 58 | 2002 |
| Conflict-free coloring for rectangle ranges using O(n.382) colors D Ajwani, K Elbassioni, S Govindarajan, S Ray Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007 | 39 | 2007 |
| Packing and covering with non-piercing regions A Basu Roy, S Govindarajan, R Raman, S Ray Discrete & Computational Geometry 60, 471-492, 2018 | 24 | 2018 |
| 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 |
| 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 | 22 | 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 | 21 | 2016 |
| A scalable algorithm for dispersing population S Govindarajan, MC Dietze, PK Agarwal, JS Clark Journal of Intelligent Information Systems 29, 39-61, 2007 | 19 | 2007 |
| 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 | 15 | 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 | 14 | 2012 |
| Small strong epsilon nets P Ashok, U Azmi, S Govindarajan Computational Geometry 47 (9), 899-909, 2014 | 12 | 2014 |
| New epsilon-net constructions. J Kulkarni, S Govindarajan CCCG, 159-162, 2010 | 11* | 2010 |
| Local search strikes again: PTAS for variants of geometric covering and packing P Ashok, A Basu Roy, S Govindarajan Journal of Combinatorial Optimization 39 (2), 618-635, 2020 | 9 | 2020 |
| I/O-efficient well-separated pair decomposition and applications S Govindarajan, T Lukovszki, A Maheshwari, N Zeh Algorithmica 45, 585-614, 2006 | 9 | 2006 |
| A variant of the Hadwiger–Debrunner (p, q)-problem in the plane S Govindarajan, G Nivasch Discrete & Computational Geometry 54 (3), 637-646, 2015 | 8 | 2015 |
| Hitting and piercing rectangles induced by a point set N Rajgopal, P Ashok, S Govindarajan, A Khopkar, N Misra Computing and Combinatorics: 19th International Conference, COCOON 2013 …, 2013 | 6 | 2013 |
| CRB-tree: An optimal indexing scheme for 2d aggregate queries PK Agarwal, L Arge, S Govindarajan Manuscript, 2002 | 6 | 2002 |
| 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 | 5 | 1990 |
| Demand hitting and covering of intervals D Krupa R, A Basu Roy, M De, S Govindarajan Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 4 | 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 |
