The following pages link to Raghunath Tewari (Q439934):
Displaying 24 items.
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- (Q2904767) (← links)
- Directed Planar Reachability Is in Unambiguous Log-Space (Q2947541) (← links)
- New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. (Q2978548) (← links)
- ReachFewL = ReachUL (Q3087954) (← links)
- Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. (Q3113721) (← links)
- An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
- Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs (Q4601861) (← links)
- (Q4608568) (← links)
- An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896) (← links)
- Randomized and Symmetric Catalytic Computation (Q5042242) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs (Q5176589) (← links)
- (Q5875572) (← links)
- (Q5875649) (← links)
- (Q5875652) (← links)
- (Q6054744) (← links)
- (Q6146251) (← links)
- (Q6187029) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
