ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 15.

Conference Proceedings

Agrawal, Akanksha and Govindarajan, Sathish and Misra, Neeldhara (2014) Vertex Cover Gets Faster and Harder on Low Degree Graphs. In: 20th International Conference on Computing and Combinatorics (COCOON), AUG 04-06, 2014, Atlanta, GA, pp. 179-190.

Conference Paper

Krupa, Datta R and Roy, Aniket Basu and De, Minati and Govindarajan, Sathish (2017) Demand Hitting and Covering of Intervals. In: 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), FEB 16-18, 2017, Sancoale, INDIA, pp. 267-280.

Khopkar, Abhijeet and Govindarajan, Sathish (2012) Hardness results for computing optimal locally Gabriel graphs. In: 24th Canadian Conference on Computational Geometry, August 8-10, 2012, Charlottetown, Prince Edward Island, Canada.

Bharadwaj, Subramanya BV and Rao, Chintan H and Ashok, Pradeesha and Govindarajan, Sathish (2012) On piercing (pseudo)lines and boxes. In: 24th Canadian Conference on Computational Geometry, August 8-10, 2012, Charlottetown, Prince Edward Island, Canada.

Bharadwaj, Subramanya BV and Govindarajan, Sathish and Sharma, Karmveer (2011) On the Erdos-Szekeres n-interior point problem. In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2001, EuroComb.

Journal Article

Roy, Aniket Basu and Govindarajan, Sathish and Raman, Rajiv and Ray, Saurabh (2018) Packing and Covering with Non-Piercing Regions. In: DISCRETE & COMPUTATIONAL GEOMETRY, 60 (2). pp. 471-492.

Roy, Aniket Basu and Govindarajan, Sathish and Raman, Rajiv and Ray, Saurabh (2018) Packing and Covering with Non-Piercing Regions. In: DISCRETE & COMPUTATIONAL GEOMETRY, 60 (2). pp. 471-492.

Govindarajan, Sathish and Khopkar, Abhijeet (2015) On Locally Gabriel Geometric Graphs. In: GRAPHS AND COMBINATORICS, 31 (5). pp. 1437-1452.

Ashok, Pradeesha and Govindarajan, Sathish (2015) On strong centerpoints. In: INFORMATION PROCESSING LETTERS, 115 (3). pp. 431-434.

Govindarajan, Sathish and Nivasch, Gabriel (2015) A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane. In: DISCRETE & COMPUTATIONAL GEOMETRY, 54 (3). pp. 637-646.

Bharadwaj, Subramanya BV and Govindarajan, Sathish and Sharma, Karmveer (2014) On the Erdos-Szekeres n-interior-point problem. In: EUROPEAN JOURNAL OF COMBINATORICS, 35 (SI). pp. 86-94.

Ashok, Pradeesha and Azmi, Umair and Govindarajan, Sathish (2014) Small strong epsilon nets. In: COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 47 (9). pp. 899-909.

Agarwal, Pankaj K and Arge, Lars and Govindarajan, Sathish and Yang, Jun and Yi, Ke (2013) Efficient external memory structures for range-aggregate queries. In: COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 46 (3). pp. 358-370.

Kolipaka, Parikshit and Govindarajan, Sathish (2013) Two player game variant of the Erdos-Szekeres problem. In: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 15 (3). pp. 73-100.

Ajwani, Deepak and Elbassioni, Khaled and Govindarajan, Sathish and Ray, Saurabh (2012) Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors. In: Discrete & Computational Geometry, 48 (1). pp. 39-52.

This list was generated on Tue Oct 15 02:17:27 2019 IST.