Welcome to my slice of virtual estate — I’m an Smt. Amba and Sri. V S Sastry Chair Assistant Professor of Computer Science and Engineering and the Associate Dean for External Communications at the Indian Institute of Technology, Gandhinagar. 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, social choice, games, geometry, and constraint satisfaction.

If you enjoy reading content online, and are broadly interested in theoretical computer science, I would strongly recommend subscribing to the TCS blog aggregator or simply following cstheory on Twitter. Also check out CSTheory Stack Exchange, which is to theoretical computer scientists what Stack Overflow and Math Overflow are to programmers and mathematicians, respectively.

Get in touch:

neeldhara.m AT iitgn.ac.in
Visualizing Baranyai's theorem for the case when n=2.



Old & New


Calvin and Hobbes by Bill Watterson for May 24, 2012