Raghunath Tewari

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 32

Top Topics

Maximum Matching

Replicator Dynamics

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Rahul Jain, Raghunath Tewari
Space efficient algorithm for solving reachability using tree decomposition and separators. Theor. Comput. Sci. 982 (2024)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-Theorems for Distance and Matching. ICALP (2022)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-theorems for Distance and Matching. CoRR (2021)
Chetan Gupta, Rahul Jain, Raghunath Tewari
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS (2021)
Anay Mehrotra, Vibhor Porwal, Raghunath Tewari
Two Player Hidden Pointer Chasing and Multi-Pass Lower Bounds in Turnstile Streams. CoRR (2020)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. CSR (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 27 (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. MFCS (2020)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. 27 (2020)
Chetan Gupta, Rahul Jain, Raghunath Tewari
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. CoRR (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. STACS (2019)
Rahul Jain, Raghunath Tewari
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. FSTTCS (2019)
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Unambiguous Catalytic Computation. FSTTCS (2019)
Rahul Jain, Raghunath Tewari
Reachability in High Treewidth Graphs. CoRR (2019)
Rahul Jain, Raghunath Tewari
Grid Graph Reachability. CoRR (2019)
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. 26 (2019)
Rahul Jain, Raghunath Tewari
Reachability in High Treewidth Graphs. ISAAC (2019)
Aayush Ojha, Raghunath Tewari
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. Electron. Colloquium Comput. Complex. 25 (2018)
Aayush Ojha, Raghunath Tewari
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. CoRR (2018)
Diptarka Chakraborty, Raghunath Tewari
) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ACM Trans. Comput. Theory 9 (4) (2018)
Chetan Gupta, Vimalraj Sharma, Raghunath Tewari
Reachability in O(log n) Genus Graphs is in Unambiguous. Electron. Colloquium Comput. Complex. 25 (2018)
Vivek Anand T. Kallampally, Raghunath Tewari
Trading Determinism for Time in Space Bounded Computations. MFCS (2016)
Vivek Anand T. Kallampally, Raghunath Tewari
Trading Determinism for Time in Space Bounded Computations. CoRR (2016)
Vivek Anand T. Kallampally, Raghunath Tewari
Trading Determinism for Time in Space Bounded Computations. Electron. Colloquium Comput. Complex. 23 (2016)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. STACS (2016)
Diptarka Chakraborty, Raghunath Tewari
) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. Electron. Colloquium Comput. Complex. 22 (2015)
Diptarka Chakraborty, Raghunath Tewari
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ISAAC (2015)
Diptarka Chakraborty, Raghunath Tewari
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. WALCOM (2015)
Diptarka Chakraborty, Raghunath Tewari
An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. CoRR (2015)
Diptarka Chakraborty, Raghunath Tewari
Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. CoRR (2015)
Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. 21 (2014)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. CoRR (2014)
Raghunath Tewari
Review of additive combinatorics by Terence Tao and Van H. Vu. SIGACT News 45 (1) (2014)
Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS (2014)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
-free Bipartite Graphs. Electron. Colloquium Comput. Complex. 21 (2014)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. Comput. Complex. 23 (1) (2014)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the power of unambiguity in log-space. Comput. Complex. 21 (4) (2012)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78 (3) (2012)
Raghunath Tewari, N. V. Vinodchandran
Green's theorem and isolation in planar graphs. Inf. Comput. 215 (2012)
Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari
Improved Bounds for Bipartite Matching on Surfaces. STACS (2012)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS (2011)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. 18 (2011)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. COCOON (2011)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Raghunath Tewari, N. V. Vinodchandran
Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the Power of Unambiguity in Logspace CoRR (2010)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari
Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR (2010)
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1 (1) (2009)
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
Directed Planar Reachability is in Unambiguous Log-Space. Computational Complexity Conference (2007)