Concepedia

Raghunath Tewari

RT

Statistics

Publications

5

Citations

120

H-Index

5

Active since

2007

Affiliations

University of Nebraska–Lincoln(Current)

Indian Institute of Technology Kanpur

Raghunath Tewari is an author at University of Nebraska–Lincoln specializing in graph theory, discrete mathematics, and engineering.

Top concepts

Graph TheoryDiscrete MathematicsEngineeringComputational ComplexityCombinatorial OptimizationComputer ScienceMathematical ProgrammingEducationFormal MethodsNetwork Science

Publications per year

2007–2014

5

Publications

5

Directed Planar Reachability Is in Unambiguous Log-Space

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran · ACM Transactions on Computation Theory · 2009 · 58 citations

Mathematical Programming, Graph Reachability Problem, Directed Graph +14

Greenʼs theorem and isolation in planar graphs

Raghunath Tewari, N. V. Vinodchandran · Information and Computation · 2012 · 19 citations

Geometric Graph Theory, Graph Theory, Planar Graph +3

Directed Planar Reachability is in Unambiguous Log-Space

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 2007 · 15 citations

Mathematical Programming, Directed Graph, Engineering +18

Space complexity of perfect matching in bounded genus bipartite graphs

Samir Datta, Raghav Kulkarni, Raghunath Tewari et al. · Journal of Computer and System Sciences · 2011 · 14 citations · Full text

Engineering, Graph Theory, Algebraic Graph Theory +8

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs

Diptarka Chakraborty, A. Pavan, Raghunath Tewari et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2014 · 14 citations · Full text

1–5 of 5