Raghunath Tewari

Raghunath Tewari is an Associate Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur. His academic journey includes a PhD from the University of Nebraska-Lincoln (2011), an MS from the same institution (2007), and a B.Sc. from Chennai Mathematical Institute (2005).

Dr. Tewari's research focuses on Computational Complexity Theory and Graph Theory, with particular expertise in space complexity, unambiguous computations, and planar graph algorithms. His work bridges theoretical computer science with practical applications in graph algorithms and computational models.

His recent publications (2009-2012) demonstrate a consistent research trajectory in computational complexity, particularly examining space-bounded computations and graph-theoretic problems. His work frequently appears in high-impact theoretical computer science venues including ACM Transactions on Computation Theory and Journal of Computer and System Sciences.

• Outstanding Ph.D. Student Award
• Outstanding Masters Student Award

Dr. Tewari teaches courses in Theoretical Computer Science and Introduction to Programming, contributing to both foundational and advanced computer science education at IIT Kanpur. His office is located in Room 514 of the Computer Science and Engineering Department building at IIT Kanpur.