Welcome to my slice of virtual estate — I am a post-doctoral fellow at the Department of Computer Science and Automation, IISc. My primary research interest involves the design and analysis of efficient algorithms for "hard" problems in general, and parameterized algorithms in particular. The problems considered are typically concerned with combinatorial optimization, frequently in the context of graph theory or constraint satisfaction.
If you enjoy reading content online, I would strongly recommend subscribing to the TCS blog aggregator (you would need a feed reader, usually your browser, or operating system, or gmail account would have one), maintained by Arvind Narayanan. Also, a nice hangout for those with a passing or serious interest in theoretical computer science is the CSTheory Stack Exchange website, a la Stack Overflow and Math Overflow.
Teaching: E0 325, Topics in Algorithms
Drop me a line at: