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)

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)

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)

Space-Efficient Algorithms for Reachability in Geometric Graphs. - Sujoy Bhore; Rahul Jain 015 (CoRR, 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 the Geometric Thickness of 2-Degenerate Graphs. - Rahul Jain 015; Marco Ricci 002; Jonathan Rollin; André Schulz 001 (SoCG, 2023)

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

Space-efficient algorithms for reachability in directed geometric graphs. - Sujoy Bhore; Rahul Jain 015 (Theor. Comput. Sci., 2023)

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

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