Results 91 to 100 of about 9,538,132 (298)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adult survivors of childhood acute lymphoblastic leukemia (ALL) are at risk of reduced exercise capacity, decreased physical activity levels, persistent fatigue, and neurocognitive deficits. The aim was to investigate exercise capacity and physical activity levels of adult survivors of childhood ALL and their associations with ...
Laura Jess +5 more
wiley +1 more source
Cubicity, degeneracy, and crossing number
European Journal of Combinatorics, 2014 A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes ...
Abhijin Adiga +2 more
openaire +6 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Febrile neutropenia (FN) is a frequent and serious complication in children receiving cancer therapy. Standardizing FN management across Asia is challenging due to variable healthcare infrastructure, diagnostic capacity, and infection patterns; however, it could improve resource use and patient outcomes.
Joliza Patricia Cañeba +29 more
wiley +1 more source
New Bounds on Crossing Numbers [PDF]
Discrete & Computational Geometry, 1999 The notation \(f(n)\ll g(n)\) means that, as \(n\) goes to infinity, \(g(n)/f(n)\) goes to infinity also. For \(g\geq 0\), let \(S_g\) denote the closed orientable 2-manifold of genus \(g\), with \(\text{cr}_g(G)\) the minimum number of crossing points among all drawings of the graph \(G\) on \(S_g\).
Pach, János +2 more
openaire +4 more sources
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Outcomes in relapsed or refractory pediatric and AYA bone sarcomas remain poor, and the impact of early referral to specialized sarcoma centers on survival is unclear. Early centralization of care may improve local and systemic treatment quality, but evidence in this population is limited.
Justyna Antoniuk‐Majchrzak +9 more
wiley +1 more source
Approximating the rectilinear crossing number
Computational Geometry, 2016 A straight-line drawing of a graph $G$ is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph $G$, $\overline{cr}(G)$, is the minimum number of crossing edges in any straight-line drawing of $G$. Determining or estimating
Fox, Jacob, Pach, János, Suk, Andrew
openaire +9 more sources
An Evolutionary Formulation of the Crossing Number Problem
Discrete Dynamics in Nature and Society, 2009 A graph drawing algorithm is presented which results in complete graphs having minimum crossings equal to that of Guy's conjecture. It is then generalized and formulated in an evolutionary algorithm (EA) to perform constrained search for the crossing ...
Che Sheng Gan +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose To explore caregivers' experiences and perceptions of the nutritional challenges faced by children and adolescents undergoing cancer treatment, including oral intake and the use of nutritional support. Methods This was a qualitative study based on focus groups with parents and caregivers at a Brazilian pediatric oncology hospital ...
Danyelle Apparecida Balsamão Marques +5 more
wiley +1 more source
The Orchard Crossing Number of an Abstract Graph [PDF]
, 2009 .We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs.
Garber, David, Feder, Elie
core