default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSathish Govindarajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Sathish Govindarajan, Siddhartha Sarkar:
Improved Algorithms for Minimum-Membership Geometric Set Cover. CALDAM 2024: 103-116- 2023
- [i11]Sathish Govindarajan, Siddhartha Sarkar:
Improved Algorithms for Minimum-Membership Geometric Set Cover. CoRR abs/2312.02722 (2023) - 2020
- [j16]Sathish Govindarajan, Anil Maheshwari:
Preface: CALDAM 2016. Discret. Appl. Math. 280: 1 (2020) - [j15]Pradeesha Ashok
, Aniket Basu Roy, Sathish Govindarajan:
Local search strikes again: PTAS for variants of geometric covering and packing. J. Comb. Optim. 39(2): 618-635 (2020)
2010 – 2019
- 2018
- [j14]Aniket Basu Roy, Sathish Govindarajan, Rajiv Raman, Saurabh Ray:
Packing and Covering with Non-Piercing Regions. Discret. Comput. Geom. 60(2): 471-492 (2018) - 2017
- [c15]Datta Krupa R., Aniket Basu Roy, Minati De, Sathish Govindarajan:
Demand Hitting and Covering of Intervals. CALDAM 2017: 267-280 - [c14]Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. COCOON 2017: 25-37 - 2016
- [j13]Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal:
Selection Lemmas for Various Geometric Objects. Int. J. Comput. Geom. Appl. 26(2): 67-88 (2016) - [c13]Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy:
Packing and Covering with Non-Piercing Regions. ESA 2016: 47:1-47:17 - [e1]Sathish Govindarajan, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9602, Springer 2016, ISBN 978-3-319-29220-5 [contents] - [i10]Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty:
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016) - 2015
- [j12]Sathish Govindarajan, Gabriel Nivasch:
A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane. Discret. Comput. Geom. 54(3): 637-646 (2015) - [j11]Sathish Govindarajan, Abhijeet Khopkar:
On Locally Gabriel Geometric Graphs. Graphs Comb. 31(5): 1437-1452 (2015) - [j10]Pradeesha Ashok, Sathish Govindarajan:
On strong centerpoints. Inf. Process. Lett. 115(3): 431-434 (2015) - 2014
- [j9]Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small strong epsilon nets. Comput. Geom. 47(9): 899-909 (2014) - [j8]B. V. Subramanya Bharadwaj, Sathish Govindarajan, Karmveer Sharma:
On the Erdős-Szekeres n-interior-point problem. Eur. J. Comb. 35: 86-94 (2014) - [j7]Abhijeet Khopkar, Sathish Govindarajan:
Hardness Results for Computing Optimal Locally Gabriel graphs. Int. J. Comput. Geom. Appl. 24(2): 153- (2014) - [c12]Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty:
On the d-Runaway Rectangle Escape Problem. CCCG 2014 - [c11]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. COCOON 2014: 179-190 - [i9]Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan:
Selection Lemmas for various geometric objects. CoRR abs/1401.0443 (2014) - [i8]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. CoRR abs/1404.5566 (2014) - [i7]Sathish Govindarajan, Gabriel Nivasch:
A variant of the Hadwiger-Debrunner (p, q)-problem in the plane. CoRR abs/1409.1194 (2014) - 2013
- [j6]Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi:
Efficient external memory structures for range-aggregate queries. Comput. Geom. 46(3): 358-370 (2013) - [j5]Parikshit Kolipaka, Sathish Govindarajan:
Two player game variant of the Erdős-Szekeres problem. Discret. Math. Theor. Comput. Sci. 15(3): 73-100 (2013) - [c10]Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra:
Hitting and Piercing Rectangles Induced by a Point Set. COCOON 2013: 221-232 - [i6]Pradeesha Ashok, Sathish Govindarajan:
On Strong Centerpoints. CoRR abs/1312.0387 (2013) - [i5]Abhijeet Khopkar, Sathish Govindarajan:
Geometric graphs on convex point sets. CoRR abs/1312.2185 (2013) - 2012
- [j4]Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48(1): 39-52 (2012) - [c9]B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan:
On Piercing (Pseudo)Lines and Boxes. CCCG 2012: 65-70 - [c8]Abhijeet Khopkar, Sathish Govindarajan:
Hardness Results for Computing Optimal Locally Gabriel Graphs. CCCG 2012: 149-154 - [i4]Sathish Govindarajan, Abhijeet Khopkar:
On Locally Gabriel Geometric Graphs. CoRR abs/1207.4082 (2012) - [i3]Parikshit Kolipaka, Sathish Govindarajan:
Two player game variant of the Erdos-Szekeres problem. CoRR abs/1207.6778 (2012) - [i2]Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small Strong Epsilon Nets. CoRR abs/1208.2785 (2012) - 2011
- [j3]B. V. Subramanya Bharadwaj, Sathish Govindarajan, Karmveer Sharma:
On the Erdos-Szekeres n-interior point problem. Electron. Notes Discret. Math. 38: 135-140 (2011) - [i1]Abhijeet Khopkar, Sathish Govindarajan:
On Computing Optimal Locally Gabriel Graphs. CoRR abs/1110.1180 (2011) - 2010
- [c7]Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni:
Small strong epsilon nets. CCCG 2010: 155-158 - [c6]Janardhan Kulkarni, Sathish Govindarajan:
New epsilon-net constructions. CCCG 2010: 159-162
2000 – 2009
- 2007
- [j2]Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark:
A scalable algorithm for dispersing population. J. Intell. Inf. Syst. 29(1): 39-61 (2007) - [c5]Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187 - 2006
- [j1]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006) - 2004
- [c4]Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark:
A scalable simulator for forest dynamics. SCG 2004: 106-115 - 2003
- [c3]Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge:
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003: 143-157 - 2002
- [c2]Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan:
Range Searching in Categorical Data: Colored Range Searching on Grid. ESA 2002: 17-28 - 2000
- [c1]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
