My research applies combinatorial and graph theoretic tools to various computational domains. My recent work has focused on the following domains:
designing algorithms for shortest paths, pattern detection and other computational problems in graphs and matrices,
reducing fundamental computational problems to one another in a fine-grained way, sometimes showing equivalences,
studying how much graph distance information can be compressed, and
computational issues in social choice: when and how can one efficiently manipulate elections, tournaments and competitions, how to measure the quality of a voting rule, etc.