Research Interest:
Approximation, Randomized, Distributed, Fixed-Parameter and Dynamic graph algorithms, Complex Network Analysis (like protein networks and other biological systems) Algorithmic game theory and theoretical aspects of Compiler design and optimization.
Current Research:
Fixed Parameter Algorithms. In particular, methods of improving kernels and designing fixed parameter algorithms for Π-Completion and Deletion problems on graphs.
MS Thesis:
Hamiltonicity and Longest Path Problem on Special Classes of Graphs. Thesis Slides
Publications:
Esha Ghosh, N. S. Narayanaswamy, and C. Pandu Rangan. A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
In: Proceedings of Workshop on Algorithms and Computation(WALCOM) 2011, pp.191-201, LNCS 6552, Springer- Verlag 2011.
Faster Parameterized Algorithms for Deletion to Split Graphs.
In: SWAT 2012, pp. 107-118, LNCS 7357, Springer, Heidelberg, 2012.
Paper Slides
Preprints:
Esha Ghosh, Subhas K. Ghosh, and C. Pandu Rangan. On Fault Tolerance and Hamiltonicity of Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs. (Under review)
Paper
Work in Progress:
Extension of the Longest Path algorithm on class of Convex Graphs. Draft