Recent Publications

All Publications

. Exact computation of the number of accepting paths of an NTM. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India, February 2018.

PDF Slides Publisher Link

. On the Tractability of $(k,i)$-Coloring. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India, February 2018.

PDF arXiv Publisher Link

. On Structural Parameterizations of the Matching Cut Problem. Proceedings of the 11th International Conference on Combinatorial Optimization and Applications - COCOA 2017, Shanghai, China, December 2017.

PDF

. Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. Presented in the 1st International Workshop on Algorithms & Architectures for Distributed Data Analytics (AADDA). Proceedings of the 18th International Conference on Distributed Computing and Networking - ICDCN 2017, Hyderabad, India, January 2017.

PDF Publisher Link

. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. Proceedings of the 27th International Workshop on Combinatorial Algorithms - IWOCA 2016, Helsinki, Finland, August 2016.

PDF Publisher Link

Students

Ph.D. Students

  • Anjeneya Swami Kare. Jan 2014 - ongoing
    (jointly supervised with N. R. Aravind)
  • Sriram Bhyravarapu. Aug 2016 - ongoing

M.Tech. Students

  • Sangram Kapre. Aug 2011 - July 2013
  • Anubhav Jain. Aug 2011 - July 2014
  • Natti Bhuvana Sai. Aug 2013 - July 2015
  • Yogesh Charan. Aug 2013 - July 2015
  • Rajeev Ranjan. Aug 2016 - July 2018

Teaching

This semester (January - April 2018)

  • CS5110. Computational Complexity. 3 credits.
  • CS6550. Scaling to Big Data (EMDS course). 3 credits.
    (co-taught with Sparsh Mittal)
  • CS5333. Computer and Network Security. 3 credits.
    (co-taught with several)

Previous semesters (full list)

I usually teach courses in the area of Theoretical Computer Science. Courses that I have offered in the past fall into broadly two categories — graduate level elective courses and undergraduate level core courses such as Data Structures, Algorithms and Theory of Computation. Click here to see the full list of courses.

Contact