About Me
I am an Associate Professor in the School of Computer Science at the University of Birmingham, where I am primarily associated with the Theory of Computation group. My research focuses on algorithms and computational complexity.
Specifically, my work is driven by sublinear-time algorithms, communication complexity, and query complexity for large-scale network analysis. I am actively engaged in graph-theoretic research, with a particular emphasis on fundamental structures such as maximum matching, minimum cut, and vertex connectivity.
Previously, I held a lectureship at the University of Sheffield. I have also worked as a post-doctoral researcher at the University of Copenhagen, KTH Royal Institute of Technology, and IUUK at Charles University. I completed my PhD in theoretical computer science at TIFR Mumbai under the guidance of Dr. Arkadev Chattopadhyay.
I am currently a recipient of the UKRI New Investigator Award. During my PhD, my research was supported by the TCS PhD Fellowship.
Highlights & News
- Award Our paper won the best paper award in ESA 2026 (Track S).
- Conference Serving as a PC member for ESA 2026, ICALP 2026, and FOCS 2026.
- Workshop Co-organizing the STOC 2026 workshop Algorithmic Frontiers of Graph and Hypergraph Problems via Global Queries (June 2026) alongside Deeparnab Chakrabarty.
- Publications New papers accepted in ESA 2026.
- Award Postdoc Vihan Shah has won the prestigious Marie Curie Postdoctoral Fellowship.
- Seminars Along with Allan Lo, I co-organize a monthly TCS + Combinatorics seminar series at Birmingham.