Rahul Jain

According to our database, Rahul Jain authored at least 13 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Space efficient algorithm for solving reachability using tree decomposition and separators.

Rahul Jain, Raghunath Tewari

Theor. Comput. Sci., January, 2024

Lossy Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

CoRR, 2024

2023

Space-efficient algorithms for reachability in directed geometric graphs.

Sujoy Bhore, Rahul Jain

Theor. Comput. Sci., June, 2023

On the Geometric Thickness of 2-Degenerate Graphs.

Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Dynamic Meta-Theorems for Distance and Matching.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Space-Efficient Algorithms for Reachability in Geometric Graphs.

Sujoy Bhore, Rahul Jain

CoRR, 2021

Reachability and Matching in Single Crossing Minor Free Graphs.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs.

Chetan Gupta, Rahul Jain, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Randomized and Symmetric Catalytic Computation.

Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2020

2019

Unambiguous Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2019

Grid Graph Reachability.

Rahul Jain, Raghunath Tewari

CoRR, 2019

Reachability in High Treewidth Graphs.

Rahul Jain, Raghunath Tewari

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability.

Rahul Jain, Raghunath Tewari

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019