He is interested in understanding the power and limits of algorithms for fundamental computational problems of practical importance and theoretical interest. The goal of his research is to advance the knowledge of these problems by either designing new efficient algorithms or revealing their intrinsic hardness using complexity-theoretic tools.