am interested in the design and analysis of algorithms and more
specifically on designing Approximation algorithms for NP-hard
problems. Besides, this I am also interested in Combinatorial
optimization and graph theory.
If you are interested in one of my papers please look at DBLP or Google Scholar or Microsoft Academic Search.
IITD students interested in working with me should look here for information on ongoing projects.
Non-IITD students: I do not offer any summer/winter projects. If you are keen on research, I would strongly advise you to apply to our masters/Ph.D. programme.