Directed Planar Reachability Is in Unambiguous Log-Space. - Chris Bourke; Raghunath Tewari; N. V. Vinodchandran (ACM Trans. Comput. Theory, 2009)

Perfect Matching in Bipartite Planar Graphs is in UL. - Samir Datta; Raghav Kulkarni; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2010)

On the Power of Unambiguity in Logspace. - Aduri Pavan; Raghunath Tewari; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2010)

Green's Theorem and Isolation in Planar Graphs. - Raghunath Tewari; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2010)

Improved Bounds for Bipartite Matching on Surfaces. - Samir Datta; Arjun Gopalan; Raghav Kulkarni; Raghunath Tewari (STACS, 2012)

On the power of unambiguity in log-space. - Aduri Pavan; Raghunath Tewari; N. V. Vinodchandran (Comput. Complex., 2012)

Space complexity of perfect matching in bounded genus bipartite graphs. - Samir Datta; Raghav Kulkarni; Raghunath Tewari; N. V. Vinodchandran (J. Comput. Syst. Sci., 2012)

ReachFewL = ReachUL. - Brady Garvin; Derrick Stolee; Raghunath Tewari; N. V. Vinodchandran (Comput. Complex., 2014)

Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (CoRR, 2014)

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2014)

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. - Diptarka Chakraborty; Aduri Pavan; Raghunath Tewari; N. Variyam Vinodchandran; Lin F. Yang (Electron. Colloquium Comput. Complex., 2014)

Review of additive combinatorics by Terence Tao and Van H. Vu. - Raghunath Tewari (SIGACT News, 2014)

An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (ISAAC, 2015)

Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. - Diptarka Chakraborty; Raghunath Tewari (WALCOM, 2015)

Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (CoRR, 2015)

An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2015)

Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (STACS, 2016)

Trading Determinism for Time in Space Bounded Computations. - Vivek Anand T. Kallampally; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2016)

Reachability in O(log n) Genus Graphs is in Unambiguous. - Chetan Gupta 002; Vimalraj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2018)

Circuit Complexity of Bounded Planar Cutwidth Graph Matching. - Aayush Ojha; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2018)

An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (ACM Trans. Comput. Theory, 2018)

An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. - Rahul Jain 015; Raghunath Tewari (FSTTCS, 2019)

Reachability in High Treewidth Graphs. - Rahul Jain 015; Raghunath Tewari (ISAAC, 2019)

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. - Chetan Gupta 002; Vimal Raj Sharma; Raghunath Tewari (STACS, 2019)

Grid Graph Reachability. - Rahul Jain 015; Raghunath Tewari (CoRR, 2019)

Unambiguous Catalytic Computation. - Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2019)

Randomized and Symmetric Catalytic Computation. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2020)

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. - Chetan Gupta 002; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2020)

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. - Chetan Gupta 002; Rahul Jain 015; Raghunath Tewari (FSTTCS, 2021)

Reachability and Matching in Single Crossing Minor Free Graphs. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (FSTTCS, 2021)

Dynamic Meta-Theorems for Distance and Matching. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (ICALP, 2022)

On Solving Reachability in Grid Digraphs using a Pseudoseparator. - Rahul Jain 015; Raghunath Tewari (Theory Comput., 2023)

Lossy Catalytic Computation. - Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (CoRR, 2024)

Deciding Reachability in a Directed Graph given its Path Decomposition. - Ronak Bhadra; Raghunath Tewari (CoRR, 2024)

Space efficient algorithm for solving reachability using tree decomposition and separators. - Rahul Jain 015; Raghunath Tewari (Theor. Comput. Sci., 2024)