| Unambiguous Catalytic Computation C Gupta, R Jain, VR Sharma, R Tewari 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 17 | 2019 |
| Randomized and symmetric catalytic computation S Datta, C Gupta, R Jain, VR Sharma, R Tewari International Computer Science Symposium in Russia, 211-223, 2020 | 12 | 2020 |
| Space efficient algorithm for solving reachability using tree decomposition and separators R Jain, R Tewari Theoretical Computer Science 982, 114251, 2024 | 7* | 2024 |
| On Solving Reachability in Grid Digraphs using a Pseudoseparator R Jain, R Tewari Theory of Computing 19 (1), 1-23, 2023 | 5* | 2023 |
| Space-constrained algorithm for computing separators in surface-embedded graphs C Gupta, R Jain, R Tewari | 2* | 2023 |
| Space-efficient algorithms for reachability in directed geometric graphs S Bhore, R Jain Theoretical Computer Science 961, 113938, 2023 | 2* | 2023 |
| On the geometric thickness of 2-degenerate graphs R Jain, M Ricci, J Rollin, A Schulz arXiv preprint arXiv:2302.14721, 2023 | 2 | 2023 |
| Reachability and matching in single crossing minor free graphs S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari arXiv preprint arXiv:2103.13940, 2021 | 2 | 2021 |
| Dynamic meta-theorems for distance and matching S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari arXiv preprint arXiv:2109.01875, 2021 | 1 | 2021 |
Raghunath TewariAssociate Professor, Indian Institute of Technology, KanpurVerified email at cse.iitk.ac.in
