Research

Research Interests

• Theoretical Computer Science

  • Combinatorics

  • Graph Theory

  • Graph Algorithms

  • Computational Complexity

Publications

• Prasun Kumar, Jayalal Sarma M.N., Saurabh Sawlani. On Directed Tree Realisations of Degree Sets. Appeared in International Workshop on Algorithms and Computation (WALCOM) 2013. Lecture Notes in Computer Science Volume 7748, 2013, pp 274-285 [PDF]

• Anant Dhayal, Jayalal Sarma M.N., Saurabh Sawlani. Polynomial Min/Max-weighted Reachability is in Unambiguous Logspace. Accepted to Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2014. [PDF] (Conference version. We are currently working on a full-version.)

Research Experience

Up until now, I have worked on a wide range of problems, almost all involving a significant amount of combinatorics. I have worked extensively on Degree Set Realization and Extension on Graphs with Prof. Jayalal and Prasun Kumar. More recently, I have worked on the space complexity of the Graph Reachability problem along with Prof. Jayalal and Anant Dhayal. As of now, I am working on Pebbling games on graphs along with Prof. Jayalal and Balagopal Komarath. Additionally, I am working on the Monotone Duality problem along with Prof. Raghavendra Rao, Prof. Jayalal and Anant Dhayal.

I hope to pursue my doctorate studies in the area of Graph Theory/Graph Algorithms in the coming few years.