~

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:

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

 

 

Old & New

Icon Old wine in a new bottle — this website just got a bit of a refresh.
Icon New talk added — a part of the rump session in the COMSOC Video Seminar, and about an open problem in the context of fair division with minimal sharing. See the talks page!
Icon New preprint on ArXiV:
Red-Blue Point Separation for Points on a Circle
(coauthored with Harshil Mittal and Aditi Sethia)  Icon
Icon New preprint on ArXiV:
Imbalance Parameterized by Twin Cover Revisited
(coauthored with Harshil Mittal)  Icon
Icon Currently Teaching: ES214, Discrete Mathematics  Icon
Icon Accepted at IJCAI 2020:
On the hardness of Multiwinner Voting Rules
(coauthored with Chinmay Sonar and Palash Dey)  Icon
Icon Accepted at IWOCA 2020:
A Parameterized Perspective on Attacking and Defending Elections
(coauthored with Kishen Gowda and Vraj Patel)  Icon

Twitter@neeldhara

Calvin and Hobbes by Bill Watterson for May 24, 2012
Icon