Results 71 to 80 of about 2,369,458 (297)

Psychological Safety Among Interprofessional Pediatric Oncology Teams in Germany: A Nationwide Survey

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Psychological safety (PS) is essential for teamwork, communication, and patient safety in complex healthcare environments. In pediatric oncology, interprofessional collaboration occurs under high emotional and organizational demands. Low PS may increase stress, burnout, and adverse events.
Alexandros Rahn   +4 more
wiley   +1 more source

Domination, Eternal Domination, and Clique Covering

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj   +1 more source

On-line computation and maximum-weighted hereditary subgraph problems [PDF]

open access: yesYugoslav Journal of Operations Research, 2011
In this paper1 we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance (a graph with n vertices) is revealed in t clusters, 2 ≤ t ≤ n .
Demange Marc   +2 more
doaj   +1 more source

Characterizing Parental Concerns About Lasting Impacts of Treatment in Children With B‐Acute Lymphoblastic Leukemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background B‐acute lymphoblastic leukemia (B‐ALL) is the most common pediatric cancer, and while most children in high‐resource settings are cured, therapy carries risks for long‐term toxicities. Understanding parents’ concerns about these late effects is essential to guide anticipatory support and inform evolving therapeutic approaches ...
Kellee N. Parker   +7 more
wiley   +1 more source

Semi Square Stable Graphs

open access: yesMathematics, 2019
The independent number of a graph G is the cardinality of the maximum independent set of G, denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G.
Mohammad Abudayah, Omar Alomari
doaj   +1 more source

A Comparative Study of Cerebral Oxygenation During Exercise in Hemodialysis and Peritoneal Dialysis Patients

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou   +10 more
wiley   +1 more source

Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions

open access: yesTheory and Applications of Graphs, 2015
The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic ...
Peter Johnson, Xiaoya Zha
doaj   +1 more source

Predicting the Future Burden of Renal Replacement Therapy in Türkiye Using National Registry Data and Comparative Modeling Approaches

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül   +2 more
wiley   +1 more source

Independent set dominating sets in bipartite graphs [PDF]

open access: yesOpuscula Mathematica, 2005
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called a set dominating set (shortly sd-set) in \(G\), if for each set \(X ...
Bohdan Zelinka
doaj  

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy