Raghunath Tewari

60 papers A* 1A 5B 6C 1Misc 2Journal 40Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Reachability in graphs having linear 2-arboricity two is NL-hard. Inf. Process. Lett. Ronak Bhadra, Raghunath Tewari
2026	J	`jnl`	Unambiguous, Randomized, and Symmetric Catalytic Computation. ACM Trans. Comput. Theory Samir Datta, Chetan Gupta, Rahul Jain, Vimalraj Sharma, Raghunath Tewari
2025	J	`jnl`	Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. CoRR Chetan Gupta, Raghunath Tewari, Vimal Raj Sharma
2025	B	`conf`	Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs. FCT Ronak Bhadra, Raghunath Tewari
2025	C	`conf`	Trading Determinism for Time: The k-Reach Problem. LAGOS Ronak Bhadra, Raghunath Tewari
2024	J	`jnl`	Deciding Reachability in a Directed Graph given its Path Decomposition. CoRR Ronak Bhadra, Raghunath Tewari
2024	J	`jnl`	Lossy Catalytic Computation. CoRR Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2024	J	`jnl`	Space efficient algorithm for solving reachability using tree decomposition and separators. Theor. Comput. Sci. Rahul Jain, Raghunath Tewari
2023	J	`jnl`	On Solving Reachability in Grid Digraphs using a Pseudoseparator. Theory Comput. Rahul Jain, Raghunath Tewari
2022	A*	`conf`	Dynamic Meta-Theorems for Distance and Matching. ICALP Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021	J	`jnl`	Dynamic Meta-theorems for Distance and Matching. CoRR Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021	—	`conf`	Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021	J	`jnl`	Reachability and Matching in Single Crossing Minor Free Graphs. CoRR Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021	—	`conf`	Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS Chetan Gupta, Rahul Jain, Raghunath Tewari
2020	B	`conf`	Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. MFCS Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2020	J	`jnl`	Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2020	Misc	`conf`	Randomized and Symmetric Catalytic Computation. CSR Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2020	J	`jnl`	Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2020	J	`jnl`	Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. CoRR Chetan Gupta, Rahul Jain, Raghunath Tewari
2019	—	`conf`	An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. FSTTCS Rahul Jain, Raghunath Tewari
2019	J	`jnl`	Grid Graph Reachability. CoRR Rahul Jain, Raghunath Tewari
2019	B	`conf`	Reachability in High Treewidth Graphs. ISAAC Rahul Jain, Raghunath Tewari
2019	J	`jnl`	Reachability in High Treewidth Graphs. CoRR Rahul Jain, Raghunath Tewari
2019	A	`conf`	Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. STACS Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2019	—	`conf`	Unambiguous Catalytic Computation. FSTTCS Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2019	J	`jnl`	Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2018	J	`jnl`	An ACM Trans. Comput. Theory Diptarka Chakraborty, Raghunath Tewari
2018	J	`jnl`	Circuit Complexity of Bounded Planar Cutwidth Graph Matching. CoRR Aayush Ojha, Raghunath Tewari
2018	J	`jnl`	Circuit Complexity of Bounded Planar Cutwidth Graph Matching. Electron. Colloquium Comput. Complex. Aayush Ojha, Raghunath Tewari
2018	J	`jnl`	Reachability in O(log n) Genus Graphs is in Unambiguous. Electron. Colloquium Comput. Complex. Chetan Gupta, Vimalraj Sharma, Raghunath Tewari
2016	A	`conf`	Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. STACS Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2016	B	`conf`	Trading Determinism for Time in Space Bounded Computations. MFCS Vivek Anand T. Kallampally, Raghunath Tewari
2016	J	`jnl`	Trading Determinism for Time in Space Bounded Computations. CoRR Vivek Anand T. Kallampally, Raghunath Tewari
2016	J	`jnl`	Trading Determinism for Time in Space Bounded Computations. Electron. Colloquium Comput. Complex. Vivek Anand T. Kallampally, Raghunath Tewari
2015	J	`jnl`	An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. CoRR Diptarka Chakraborty, Raghunath Tewari
2015	J	`jnl`	An O(n Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Raghunath Tewari
2015	B	`conf`	An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ISAAC Diptarka Chakraborty, Raghunath Tewari
2015	J	`jnl`	Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. CoRR Diptarka Chakraborty, Raghunath Tewari
2015	B	`conf`	Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. WALCOM Diptarka Chakraborty, Raghunath Tewari
2014	J	`jnl`	Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. CoRR Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2014	J	`jnl`	Derandomizing Isolation Lemma for K Electron. Colloquium Comput. Complex. Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2014	—	`conf`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
2014	J	`jnl`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang
2014	J	`jnl`	ReachFewL = ReachUL. Comput. Complex. Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2014	J	`jnl`	Review of additive combinatorics by Terence Tao and Van H. Vu. SIGACT News Raghunath Tewari
2012	J	`jnl`	Green's theorem and isolation in planar graphs. Inf. Comput. Raghunath Tewari, N. V. Vinodchandran
2012	A	`conf`	Improved Bounds for Bipartite Matching on Surfaces. STACS Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari
2012	J	`jnl`	On the power of unambiguity in log-space. Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2012	J	`jnl`	Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2011	Misc	`conf`	ReachFewL = ReachUL. COCOON Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2011	J	`jnl`	ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2011	A	`conf`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran
2010	J	`jnl`	Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	On the Power of Unambiguity in Logspace CoRR Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. Samir Datta, Raghav Kulkarni, Raghunath Tewari
2010	J	`jnl`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2009	J	`jnl`	Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
2007	A	`conf`	Directed Planar Reachability is in Unambiguous Log-Space. CCC Chris Bourke, Raghunath Tewari, N. V. Vinodchandran