| 2026 | IWOCA | Reachability in Graphs with Polynomially Many Surface Non-separating Cycles is in UL. | Neelabjo Shubhashis Choudhury, Chetan Gupta, Raghunath Tewari |
| 2026 | MFCS | Parameterizing the Complexity of Finding Long Paths in DAGs. | Ronak Bhadra, Saurya Singh, Raghunath Tewari |
| 2025 | FCT | Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs. | Ronak Bhadra, Raghunath Tewari |
| 2025 | LAGOS | Trading Determinism for Time: The k-Reach Problem. | Ronak Bhadra, Raghunath Tewari |
| 2022 | ICALP | Dynamic Meta-Theorems for Distance and Matching. | Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari |
| 2020 | CSR | Randomized and Symmetric Catalytic Computation. | Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari |
| 2020 | MFCS | Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. | Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari |
| 2019 | ISAAC | Reachability in High Treewidth Graphs. | Rahul Jain, Raghunath Tewari |
| 2019 | STACS | Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. | Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari |
| 2016 | MFCS | Trading Determinism for Time in Space Bounded Computations. | Vivek Anand T. Kallampally, Raghunath Tewari |
| 2016 | STACS | Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. | Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari |
| 2015 | ISAAC | An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. | Diptarka Chakraborty, Raghunath Tewari |
| 2015 | WALCOM | Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. | Diptarka Chakraborty, Raghunath Tewari |
| 2012 | STACS | Improved Bounds for Bipartite Matching on Surfaces. | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
| 2011 | COCOON | ReachFewL = ReachUL. | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
| 2011 | STACS | Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |