Quotes

 If we knew what
 it was that we
 were doing, it
 wouldn't be
 called research.
 Would it?
Research
In December 2008, I defended my thesis, written under the supervision of Prof. L. Sunil Chandran. Before joining DA-IICT as visiting faculty, I worked with Prof. Sathish Govindarajan to give (lower) bounds on the maximum edge complexity of Locally Gabriel Graphs. I also explored some geometric dimensions of graphs like Cubicity, Boxicity and Sphere-of-Influence graph dimension with Sunil Sir. We showed that the cubicity of the d-dimensional grid is upper bounded by d+1, extending a similar result known for hypercubes.

Areas of Interest
Theory of Computation - Algorithms, Classical Computational Complexity, Quantum Computational Complexity.
Combinatorics - Graph Theory, Combinatorial Geometry, Set Systems.

Publications
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems, presented at International Symposium on Algorithms and Compuation, 2006
Cubicity, Boxicity and Vertex Cover, to appear in Journal of Discrete Mathematics.

Work in Progress
Cubicity and Sphere-of-Influence Graph Dimension.
An upper bound on the Cubicity of Grid Graphs.

Presentations and Talks
Reconstructing Sets From Interpoint Distances - The Beltway Problem and Homometric Sets for the Turnpike and Beltway Problems. Presentation given as part of the course Topics in Algorithms taken by Dr. Ramesh Hariharan. (pdf)

Maximum Matchings through Gaussian Elimination - Randomized Algorithms for finding maximum matchings in bipartite and general graphs in O(n^w) time. Presentation in the Theory Reading Group. (pdf)

A talk on Approximation Algorithms for Connected Dominating Sets.

Efficient Randomized Algorithms for Weighted Rank-Maximal Matchings and Popular Matchings. Presentation at ISAAC 2006. (pdf)