Dr. Rahul Jain

Artikel in Zeitschriften

• Rahul Jain; Raghunath Tewari: On Solving Reachability in Grid Digraphs using a Pseudoseparator, in Theory of Computing, Vol. 19, No. 2, pp. 1-23, 2023
• Sujoy Bhore; Rahul Jain: Space-efficient algorithms for reachability in directed geometric graphs, in Theoretical Computer Science, Vol. 961, pp. 113938, 2023

Konferenzbandbeiträge

• Rahul Jain; Marco Ricci; Jonathan Rollin; André Schulz: On the Geometric Thickness of 2-Degenerate Graphs, in 39th International Symposium on Computational Geometry, SoCG 2023
• Samir Datta; Chetan Gupta; Rahul Jain; Anish Mukherjee; Vimal Raj Sharma; Raghunath Tewari: Dynamic Meta-Theorems for Distance and Matching, in Leibniz International Proceedings in Informatics (LIPIcs) - 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Vol. 229, pp. 118:1-118:20, 2022
• Samir Datta; Chetan Gupta; Rahul Jain; Anish Mukherjee; Vimal Raj Sharma; Raghunath Tewari: Reachability and Matching in Single Crossing Minor Free Graphs, in Leibniz International Proceedings in Informatics (LIPIcs) - 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Vol. 213, pp. 16:1-16:16, 2021
• Sujoy Bhore; Rahul Jain: Space-Efficient Algorithms for Reachability in Directed Geometric Graphs, in Leibniz International Proceedings in Informatics (LIPIcs) - 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Vol. 212, pp. 63:1-63:17, 2021
• Chetan Gupta; Rahul Jain; Raghunath Tewari: Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs, in Leibniz International Proceedings in Informatics (LIPIcs) - 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Vol. 213, pp. 23:1-23:15, 2021
• Samir Datta; Chetan Gupta; Rahul Jain; Vimal Raj Sharma; Raghunath Tewari: Randomized and Symmetric Catalytic Computation, in Computer Science - Theory and Applications - Proceedings of the 15th International Computer Science Symposium in Russia, {CSR} 2020, Lecture Notes in Computer Science, Vol. 12159, pp. 211-223
• Rahul Jain; Raghunath Tewari: An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability, in 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), LIPIcs, Vol. 150, pp. 19:1-19:14
• Rahul Jain; Raghunath Tewari: Reachability in High Treewidth Graphs, in 30th International Symposium on Algorithms and Computation (ISAAC 2019), LIPIcs, Vol. 149, pp. 12:1-12:14
• Chetan Gupta; Rahul Jain; Vimal Raj Sharma; Raghunath Tewari: Unambiguous Catalytic Computation, in 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, LIPIcs, Vol. 150, pp. 16:1-16:13