Neeldhara Misra

Use this for easy navigation to main pages. This is hidden on your site
Put the block below back up later, once the pages are fleshed out.
ResumeResearch GroupCommunications Team
Add PDF of CV on this page.

Neeldhara Misra

Smt. Amba and Sri. V S Sastry Chair Associate Professor Computer Science and Engineering at IIT Gandhinagar Old homepage (The new website, i.e, this one, is work in progress, and the old one is dated. Sorry.)


My broad research interests include — in no particular order: algorithm design, computational social choice, combinatorial games. You can find out more about my work here.

If you enjoy reading content online, and are broadly interested in theoretical computer science, I would suggest subscribing to the TCS blog aggregator or simply following cstheory on Twitter.


Visualizing Baranyai's theorem with n=2.




Work on Imbalance parameterized by twin cover now in TCS
Dec 4, 2021
Joint work with Harshil Mittal ⸱ Published in Theoretical Computer Science (Dec 2021) ⸱ A shorter version was accepted at COCOON 2020 ⸱ Preprint available from ArXiV
Imbalance is a layout optimization problem, where we would like to order the vertices of a graph so that, roughly speaking, vertices have their neighbors split up as equally as possible on their left and right. We examine the parameterized complexity of the problem with respect to a structural parameter called twin cover.
NPTEL Registration is Live
Dec 1, 2021
My course on Getting Started with Competitive Programming will run from 24 Jan 2022 to 15 Apr 2022. The deadline to register is 31st January 2022.
(More generally, the NPTEL Jan 2022 semester is open with courses across engineering, humanities and social sciences. You can enrol in these courses at no cost here and get a certification by taking up a proctored exam for a nominal fee of Rs 1,000 per course.)
FUN 2022 Dates Announced
Nov 30, 2021
Submit your most fun work to FUN 2022! Also spread the word with a retweet :)
New Work on Local Fair Division
Nov 22, 2021
Joint work with Debanuj Nayak ⸱ Accepted at CALDAM 2022 ⸱ Preprint available from ArXiV
These developments explore the complexity of finding envy-free allocations of indivisible items in settings where envy is only experienced between friends, the valuations over items are binary, and the social network over agents is given by an undirected graph.