I am an Assistant Professor in the Discipline of Computer Science & Engineering, IIT Indore
I broadly work in spectral graph theory, that is, the study of graphs using the matrices associated with graphs like adjacency matrix, Laplacian matrix, Seidel matrix, etc. The two problem I am primarily interested in are
- the constructions of the expander graphs and in particular explicit construction of Ramanujan graphs which are the best possible expanders.
- For more detail see an excellent survey by Hoory, Linial, Wigderson
- matrix determinant (P) vs matrix permanent (#P-complete) problem.
For the students who want to work with me: please drop me an email if your are interested in the following reasearch areas: Algorithmic Graphs (Matrix) Theory, Computational Complexity, Complex network analysis.
Current project under me (Funded by DST): “Reducing parameterized complexities of matrix determinant and permanents”.
Room No. 408 POD 1 A, IIT Indore
Indore-453552, MP, India