Raghunath Tewari

Office:
Room Number 221
Department of Computer Science and Engineering
Indian Institute of Technology, Kanpur
Kanpur - 208 016, UP, India.

+91 (512) 259 7174
rtewari at cse dot iitk dot ac dot in

December 2011 -- present, Assistant Professor, Indian Institute of Technology, Kanpur.
July 2011 -- December 2011, Assistant Professor, Indian Institute of Technology, Kharagpur.
June 2011 -- July 2011, Lecturer, University of Nebraska - Lincoln.
June 2009 -- May 2011, Research Assistant, University of Nebraska - Lincoln.
August 2005 -- May 2009, Teaching Assistant, University of Nebraska - Lincoln.

ReachFewL = ReachUL (with Brady Garvin, Derrick Stolee and N. V. Vinodchandran). Computational Complexity (to appear).
Green's Theorem and Isolation in Planar Graphs (with N. V. Vinodchandran). Information and Computation (to appear).
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs (with Samir Datta, Raghav Kulkarni and N. V. Vinodchandran). Journal of Computer and System Sciences (to appear).
On the Power of Unambiguity in Logspace (with A. Pavan and N. V. Vinodchandran). Computational Complexity (to appear).
Directed Planar Reachability is in Unambiguous Logspace (with Chris Bourke and N. V. Vinodchandran). ACM Transactions on Computation Theory 1(1), 2009, pages 1-17.

Improved bounds on Bipartite Matching on surfaces (with Samir Datta, Arjun Gopalan and Raghav Kulkarni). In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012 (accepted).
ReachFewL = ReachUL (with Brady Garvin, Derrick Stolee and N. V. Vinodchandran). ECCC Technical Report 11-060. In 17th Annual International Computing and Combinatorics Conference, pages 252-258, 2011.
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs (with Samir Datta, Raghav Kulkarni and N. V. Vinodchandran). In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, pages 579-590, 2011.
Directed Planar Reachability is in Unambiguous Logspace (with Chris Bourke and N. V. Vinodchandran). In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 217-221, 2007.
Optimal Segment Size for Fixed-sized Segment Protection in Wavelength-routed Optical Networks (with Byrav Ramamurthy). In IEEE International Symposium on Advanced Networks and Telecommunication Systems (ANTS). December 2009., pp. 1-3.

Unambiguous Logarithmic Space Bounded Computations. Doctoral Dissertation, University of Nebraska - Lincoln, March 2011.
On the Space Complexity of Directed Graph Reachability. Master's Thesis, University of Nebraska - Lincoln, May 2007.

Outstanding Ph.D. Student Award, Dept. of Computer Science and Engineering at University of Nebraska - Lincoln.
Awarded $1000 travel grant by the Dept. of Computer Science, University of Nebraska - Lincoln.
Outstanding Master's Award, Dept. of Computer Science and Engineering at University of Nebraska - Lincoln.
One of the selected candidates for the Preparing Future Faculty program at University of Nebraska - Lincoln.
One of the 30 students selected for the undergraduate program at Chennai Mathematical Institute through an entrance exam conducted all over India, with full scholarship.

How powerful is logspace unambiguity? At the colloquium at Chennai Mathematical Institute, November 2011.
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. At the 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, March 2011.
Green’s Theorem and its Application to the Isolation Problem in Planar Graphs. At the Computer Science Departmental Colloquium, University of Massachusetts-Amherst, September 2010.
Space Complexity of Directed Graph Reachability. At the Discrete Math Seminar in the Mathematics Department at UNL, September 2007.
Directed Planar Reachability is in Unambiguous Logspace. At the 22nd Annual IEEE Conference on Computational Complexity, San Diego, USA, June 2007.

Reviewed papers for IEEE Conference on Computational Complexity (CCC), Symposium on Theoretical Aspects of Computer Science (STACS) and Foundations of Software Technology and Theoretical Computer Science (FSTTCS).
Department representative at the Graduate Student Association at UNL.
Member of the selection committee for the CSE Award Ceremony 2011.
Student representative at the CSE Graduate Recruiting Committee.
Successfully qualified through the Institute for International Teaching Assistants at UNL.
Proficient in programming languages including C, C++, Java, Haskell and MATLAB.