Pravesh K. Kothari
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Algorithms×2Combinatorics×2Discrete Math×1Optimization and Control×1
Frequent co-authors
Research Timeline
2026
Optimal Sparsifiers for Abelian Cayley Graphs
This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code sparsifiers for F2-linear codes.
A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
Highlighted terms show continued research focus across papers