Raghunath Tewari
VIDWAN ID: 53388

Dr Raghunath Tewari

Male Doctor of Philosophy
Associate Professor | Department of Computer Science and Engineering
Indian Institute of Technology, Kanpur
Uttar Pradesh
Expertise: Computer Science Theory and Methods
34 Publications
0 Projects
229 Scopus Citations
110 CrossRef
14 Years 9 Months Total Experience
Publications
34 Total
Articles
10
Chapters
1
Proceedings
23
Activity

No publication activity to display.

Scopus Scopus
229 Citations
9 h-index
CrossRef CrossRef
110 Citations
6 h-index
Google Scholar Google Scholar

Loading Scholar statistics...

Professional Recognition

No Data Found

There is currently nothing to display here.

Community & Membership

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Personal Details

Doctor of Philosophy
2011
N/A
Associate Professor
Dec 2011 – Present
Indian Institute of Technology, Kanpur | Department of Computer Science and Engineering
Engineering and Technology
Computer Science Theory and Methods

Related Profiles

Scholarly Work

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Scholarly Publications

Directed planar reachability is in unambiguous log-space

Conference Paper
Year: 2007. Pages: 217-221 .
Authors: Chris Bourke; Raghunath Tewari; N.V. Vinodchandran

Directed planar reachability is in unambiguous log-space

Journal Article
ACM Transactions on Computation Theory. Year: 2009. Volume: 1 , Issue: 1 .
Authors: Chris Bourke; Raghunath Tewari; N. V. Vinodchandran

Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks

Conference Paper
Year: 2009.
Authors: Raghunath Tewari; Byrav Ramamurthy

ReachFewL = ReachUL

Conference Paper
Year: 2011. Volume: 6842 LNCS , Pages: 252-258 .
Authors: Brady Garvin; Derrick Stolee; Raghunath Tewari; N. V. Vinodchandran

Space complexity of perfect matching in bounded genus bipartite graphs

Conference Paper
Year: 2011. Volume: 9 , Pages: 579-590 .

Space complexity of perfect matching in bounded genus bipartite graphs

Open Access
Journal Article
Journal of Computer and System Sciences. Year: 2012. Volume: 78 , Issue: 3 , Pages: 765-779 .
Authors: Samir Datta; Raghav Kulkarni; Raghunath Tewari; N.V. Vinodchandran

Improved bounds for bipartite matching on surfaces

Conference Paper
Year: 2012. Volume: 14 , Pages: 254-265 .

On the power of unambiguity in log-space

Journal Article
Computational Complexity. Year: 2012. Volume: 21 , Issue: 4 , Pages: 643-670 .
Authors: A. Pavan; Raghunath Tewari; N. V. Vinodchandran
Showing 1 to 8 of 34 publications