Raghunath Tewari

According to our database, Raghunath Tewari authored at least 34 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• 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

Deciding Reachability in a Directed Graph given its Path Decomposition.

Ronak Bhadra, Raghunath Tewari

CoRR, 2024

Lossy Catalytic Computation.

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

CoRR, 2024

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

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

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 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 O(log n) Genus Graphs is in Unambiguous Logspace.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 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

2018

An <i>O</i>(<i>n</i>^ε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

Diptarka Chakraborty, Raghunath Tewari

ACM Trans. Comput. Theory, 2018

Circuit Complexity of Bounded Planar Cutwidth Graph Matching.

Aayush Ojha, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2018

Reachability in O(log n) Genus Graphs is in Unambiguous.

Chetan Gupta, Vimalraj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2018

2016

Trading Determinism for Time in Space Bounded Computations.

Vivek Anand T. Kallampally, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2016

Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs.

Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

An O(n^ε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

Diptarka Chakraborty, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2015

Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs.

Diptarka Chakraborty, Raghunath Tewari

CoRR, 2015

Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs.

Diptarka Chakraborty, Raghunath Tewari

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

Diptarka Chakraborty, Raghunath Tewari

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Review of additive combinatorics by Terence Tao and Van H. Vu.

Raghunath Tewari

SIGACT News, 2014

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.

Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang

Electron. Colloquium Comput. Complex., 2014

Derandomizing Isolation Lemma for K_3,3-free and K₅-free Bipartite Graphs.

Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2014

Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs.

Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari

CoRR, 2014

ReachFewL = ReachUL.

Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran

Comput. Complex., 2014

2012

Space complexity of perfect matching in bounded genus bipartite graphs.

Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran

J. Comput. Syst. Sci., 2012

On the power of unambiguity in log-space.

Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran

Comput. Complex., 2012

Improved Bounds for Bipartite Matching on Surfaces.

Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2010

Green's Theorem and Isolation in Planar Graphs.

Raghunath Tewari, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2010

On the Power of Unambiguity in Logspace.

Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2010

Perfect Matching in Bipartite Planar Graphs is in UL.

Samir Datta, Raghav Kulkarni, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2010

2009

Directed Planar Reachability Is in Unambiguous Log-Space.

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran

ACM Trans. Comput. Theory, 2009