Updates: Our recent work is accepted for publication in the proceedings of FSTTCS 2025.

Publications can be found either via Google scholar or DBLP.

Below I briefly discuss the research areas I work in or interested in working in.

Algorithms for matchings under preferences

Many real-world applications have the following flavor: a set of resources to be assigned to a set of agents. Additionally, there are preferences involved. As an example, consider college admissions -- students have their own preference ordering over colleges and colleges also have a ranking over students, say based on their scores in an entrance exam. Given this information (and many other practical constraints), the goal is to compute a "good" assignment between agents and resources.

Some interesting questions that are investigated in this area are as follows:

• How to quantify "goodness" of an assignment?

• Can the given "good" notion be computed "efficiently" (polynomial time vs. NP-hard)?

• If not, what are practical alternatives (approximation algorithms, parameterized algorithms and so on)?

During my Ph.D. I worked on a couple of problems in this area. Currently I am actively working in this area.

Teaching Theoretical CS

I enjoy learning and teaching topics in the theoretical CS. I am interested in exploring questions such as:

• How to make students comfortable with "abstraction"?

• How to make students appreciate and enjoy the process of mathematical theorem proving?

• What are some efficient ways to teach proof techniques?

• How to teach problem solving and logic development without relying on a programming language?

• Which tools may be helpful in teaching theoretical CS and how to build them?

This work is at the intersection of Theoretical CS and cognitive science.

I am open to collaboration opportunities in this area as well as looking for students with interesting ideas and create a POC.

Computational modelling for Hindustani classical music

Given my deep interest in Hindustani classical music, I am interested in formulating computational models of Hindustani classical Raagas. The idea is not to use data (that is, no machine learning based approach) but formulate a model similar to finite automata based on ancient writings about Hindustani classical music.

I am looking for enthusiastic students with some background in classical music (vocal or instrumental) to brainstorm ideas and create a POC.

Structural graph theory

I am fascinated by "characterization" type of results.

In particular, I am interested in structural characterization of graphs. During my Ph.D. I spent some time exploring this area under guidance of Prof. Nishad Kothari (IIT Madras).

I am open to collaboration opportunities in this area.

Other interests

• Cryptography

• Consensus mechanisms used in blockchain technology

• Modern complexity theory

Currently, I am not working on any research questions in these areas but studying these subjects.