About
My work has mainly been focused on computational complexity, in particular the bounded space complexity, parallel complexity and dynamic complexity of various graph problems, especially when restricted to planar graphs and related graph classes such as bounded tree width, bounded genus, H-minor free etc. The problems range from very simple like reachability, to NP-hard problems like Travelling Salesman Problem (TSP) via intermediate ones like restricted versions of the circuit value problem, embedding on surfaces, matching problems and graph isomorphism. I have also worked in circuit complexity - mainly in providing alternative characterizations and proving properties of arithmetic circuits. Other sporadic ventures include complexity aspects of game theory, proof theory and numerical analysis. Apart from interests in these and related areas I am open to problems which have the possibility of proving complexity bounds for new problems or applying ideas from graph theory.