Publications

Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs (joint work with Rameesh Paul and Anand Louis)(ICALP 2022)

The complexity of testing all properties of planar graphs, and the role of isomorphism (joint work with Sabyasachi Basu and C. Seshadhri) (SODA 2022) (Covered in Oded Goldreich's choices)

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes (joint work with C. Seshadhri and Andrew Stolman) (FOCS 2021) (Covered in Oded Goldreich's choices)

Random walks and forbidden minors II: A poly(dε−1)-query tester for minor-closed properties of bounded-degree graphs (joint work with C. Seshadhri and Andrew Stolman) (STOC 2019) (Invited to SICOMP) (Covered in Oded Goldreich's choices)

Finding forbidden minors in sublinear time: a O(n^{1/2+o(1)}) -query one-sided tester for minor closed properties on bounded degree graphs (joint work with C. Seshadhri and Andrew Stolman) (FOCS 2018) (Invited to SICOMP) (Covered in Oded Goldreich's choices)

Flipping out with Many Flips: Hardness of Testing k-Monotonicity (joint work with Elena Grigorescu and Karl Wimmer) (Random 2018)(Slides)

Finding Pseudorandom Colorings of Pseudorandom Graphs (joint work with Anand Louis and Madhur Tulsiani) (In FSTTCS 2017)

Testing k-Monotonicity (The Rise and Fall of Boolean Functions) (joint work with Clement Canonne, Elena Grigorescu, Siyao Guo and Karl Wimmer) (in ITCS 2017) 

Approximation algorithms for digraph width parameters (joint work with Shiva Kintali and Nishad Kothari) (Journal: Theoretical Computer Science 2015)