Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Algorithms for the Independent Feedback Vertex Set Problem
Water Deprivation Increases (Pro)renin Receptor Levels in the Kidney and Decreases Plasma Concentrations of Soluble (Pro)renin Receptor.
- Yuma Tamura, N. Mori, +7 authors M. Kohzuki
- Chemistry, Medicine
- The Tohoku journal of experimental medicine
- 1 July 2016
Water deprivation activates the renin-angiotensin system. We have hypothesized that the renal expression of (pro)renin receptor ((P)RR), a specific receptor for renin and prorenin, could be changed… Expand
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
A feedback vertex set F of an undirected graph G is a vertex subset of G whose removal results in a forest. Expand
Abstract 376: The Expression of (pro)renin Receptor is Upregulated in the Kidney by High Salt Diet and No Inhibition
The (pro)renin receptor ((P)RR)-bound (pro)renin not only causes the generation of angiotensin II via the increased enzymatic activity, it also activates the receptor’s own intracellular signaling… Expand
Abstract 377: Expression of Soluble and Full-length (pro)renin Receptor by Dehydration
Recently, (pro)renin receptor ((P)RR), a specific receptor for renin and prorenin, was newly identified as a member of the renin angiotensin system (RAS). (P)RR binding to the prorenin, causes the… Expand
Abstract 421: Dehydration Upregulates the Full-length (Pro)renin Receptor Expression in the Kidney of Wistar-Kyoto Rats and Spontaneously Hypertensive Rats
(Pro)renin receptor ((P)RR) was newly identified as a member of the renin-angiotensin system (RAS). (P)RR exists in two forms; full-length form (f(P)RR) and soluble form (s(P)RR). The truncated hyd...
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
In this paper, we study the approximability of the independent feedback vertex set problem for bipartite planar graphs and show that, for any fixed \(\varepsilon > 0\), there exists no polynomial-time 2-approximation algorithm for the problem. Expand
Approximability of the independent feedback vertex set problem for bipartite graphs
We study the approximability of the independent feedback vertex set problem for bipartite graphs of maximum degree Δ, and give a polynomial-time algorithm to solve it. Expand