default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaghunath Tewari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Rahul Jain
, Raghunath Tewari:
Space efficient algorithm for solving reachability using tree decomposition and separators. Theor. Comput. Sci. 982: 114251 (2024)- [i28]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Lossy Catalytic Computation. CoRR abs/2408.14670 (2024) - [i27]Ronak Bhadra, Raghunath Tewari:
Deciding Reachability in a Directed Graph given its Path Decomposition. CoRR abs/2409.18469 (2024) - 2022
- [c18]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-Theorems for Distance and Matching. ICALP 2022: 118:1-118:20 - 2021
- [c17]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS 2021: 16:1-16:16 - [c16]Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS 2021: 23:1-23:15 - [i26]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR abs/2103.13940 (2021) - [i25]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-theorems for Distance and Matching. CoRR abs/2109.01875 (2021) - 2020
- [c15]Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Randomized and Symmetric Catalytic Computation. CSR 2020: 211-223 - [c14]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. MFCS 2020: 43:1-43:13 - [i24]Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. CoRR abs/2005.06419 (2020) - [i23]Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. TR20 (2020) - [i22]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c13]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. FSTTCS 2019: 16:1-16:13 - [c12]Rahul Jain, Raghunath Tewari:
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. FSTTCS 2019: 19:1-19:14 - [c11]Rahul Jain, Raghunath Tewari:
Reachability in High Treewidth Graphs. ISAAC 2019: 12:1-12:14 - [c10]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. STACS 2019: 34:1-34:13 - [i21]Rahul Jain, Raghunath Tewari:
Reachability in High Treewidth Graphs. CoRR abs/1901.11285 (2019) - [i20]Rahul Jain, Raghunath Tewari:
Grid Graph Reachability. CoRR abs/1902.00488 (2019) - [i19]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j7]Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ACM Trans. Comput. Theory 9(4): 19:1-19:11 (2018) - [i18]Aayush Ojha, Raghunath Tewari:
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. CoRR abs/1801.00906 (2018) - [i17]Chetan Gupta, Vimalraj Sharma, Raghunath Tewari:
Reachability in O(log n) Genus Graphs is in Unambiguous. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Aayush Ojha, Raghunath Tewari:
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. Electron. Colloquium Comput. Complex. TR18 (2018) - 2016
- [c9]Vivek Anand T. Kallampally, Raghunath Tewari:
Trading Determinism for Time in Space Bounded Computations. MFCS 2016: 10:1-10:13 - [c8]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. STACS 2016: 10:1-10:15 - [i15]Vivek Anand T. Kallampally, Raghunath Tewari:
Trading Determinism for Time in Space Bounded Computations. CoRR abs/1606.04649 (2016) - [i14]Vivek Anand T. Kallampally, Raghunath Tewari:
Trading Determinism for Time in Space Bounded Computations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c7]Diptarka Chakraborty, Raghunath Tewari:
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ISAAC 2015: 614-624 - [c6]Diptarka Chakraborty, Raghunath Tewari:
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. WALCOM 2015: 258-269 - [i13]Diptarka Chakraborty, Raghunath Tewari:
An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. CoRR abs/1501.05828 (2015) - [i12]Diptarka Chakraborty, Raghunath Tewari:
Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. CoRR abs/1502.02135 (2015) - [i11]Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j6]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Comput. Complex. 23(1): 85-98 (2014) - [j5]Raghunath Tewari:
Review of additive combinatorics by Terence Tao and Van H. Vu. SIGACT News 45(1): 24-26 (2014) - [c5]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: 585-595 - [i10]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. CoRR abs/1411.7614 (2014) - [i9]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]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. TR14 (2014) - 2012
- [j4]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the power of unambiguity in log-space. Comput. Complex. 21(4): 643-670 (2012) - [j3]Raghunath Tewari, N. V. Vinodchandran:
Green's theorem and isolation in planar graphs. Inf. Comput. 215: 1-7 (2012) - [j2]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): 765-779 (2012) - [c4]Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari:
Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265 - 2011
- [c3]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. COCOON 2011: 252-258 - [c2]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590 - [i7]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i6]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010) - [i5]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010) - [i4]Samir Datta, Raghav Kulkarni, Raghunath Tewari:
Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. TR10 (2010) - [i3]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i2]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010) - [i1]Raghunath Tewari, N. V. Vinodchandran:
Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1(1): 4:1-4:17 (2009) - 2007
- [c1]Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability is in Unambiguous Log-Space. CCC 2007: 217-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
