Results 111 to 120 of about 9,538,132 (298)

Forecasting the Dialysis Burden in Japan: Validation‐Based Projections of Prevalence and Incidence Through 2050

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin   +2 more
wiley   +1 more source

The genus crossing number

open access: yesArs Mathematica Contemporanea, 2009
Pach and Toth [PT] introduced a new version of the crossing number parameter, called the degenerate crossing number, by considering proper drawings of a graph in the plane and counting multiple crossing of edges through the same point as a single crossing when all pairwise crossings of edges at that point are transversal. We propose a related parameter,
openaire   +2 more sources

Association Between Individualized Education for Kidney Replacement Therapy Modality Selection and Peritoneal Dialysis Initiation: A Cross‐Sectional Study

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito   +7 more
wiley   +1 more source

Hardness of Approximation for Crossing Number [PDF]

open access: yesDiscrete & Computational Geometry, 2012
We show that, if P\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
openaire   +3 more sources

The Crossing Numbers of Products of Path with Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj   +1 more source

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Hypohamiltonian Graphs and their Crossing Number [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2012
We prove that for every $k \ge 0$ there is an integer $n_0(k)$ such that, for every $n \ge n_0$, there exists a hypohamiltonian graph which has order $n$ and crossing number $k$.
openaire   +4 more sources

Conjectures About Wheels Without One Edge with Paths and Cycles

open access: yesMathematics
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj   +1 more source

Organizing the interface—Plasma membrane architecture and receptor dynamics in virus‐cell interactions

open access: yesFEBS Letters, EarlyView.
Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley   +1 more source

An Index Refined Winding Pair Polynomial for Planar Knotoids

open access: yesAxioms
Planar knotoids contain endpoint position information because the forbidden endpoint moves prevent the leg and the head from passing across arcs. Existing polynomial invariants based on Gauss diagrams and winding data record important parts of this ...
Liang Liang, Liyuan Ma
doaj   +1 more source

Home - About - Disclaimer - Privacy