Results 41 to 50 of about 402,994 (257)

Imaging of High‐Risk Neuroblastoma: Recommendations From SIOPEN Radiology and Nuclear Medicine Specialty Committees

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Neuroblastoma is the most common extracranial solid tumor in early childhood. Its clinical behavior is highly variable, ranging from spontaneous regression to fatal outcome despite intensive treatment. The International Society of Pediatric Oncology Europe Neuroblastoma Group (SIOPEN) Radiology and Nuclear Medicine Specialty Committees ...
Annemieke Littooij   +11 more
wiley   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen   +23 more
wiley   +1 more source

Distinguishing Cartesian Products of Countable Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan   +4 more
doaj   +1 more source

Changing, Annulling and Otherwising the Past

open access: yesPhilosophies, 2021
Despite a growing number of models argument for the logical possibility of changing the past there continues to be resistance to and confusion surrounding the possibility of changing the past.
G. C. Goddu
doaj   +1 more source

Automorphisms and Distinguishing Numbers of Geometric Cliques [PDF]

open access: yesDiscrete & Computational Geometry, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albertson, Michael O., Boutin, Debra L.
openaire   +2 more sources

Molecular Methods for Rare Hemoglobinopathy Cases: First Brazilian Report of Pediatric Siblings with Hb O‐Arab and Alpha‐Thalassemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Hemoglobinopathies are prevalent globally; diagnosis is complex in high genetic admixture populations like Brazil. We report, in two pediatric siblings, the first documented cases in Brazil of heterozygosity for hemoglobin (Hb) O‐Arab with coinheritance of α‐thalassemia (αα/−α4.2; −α3.7/−α4.2), resulting in microcytic and hypochromic anemia ...
Elisângela de Souza Miranda Muynarsk   +9 more
wiley   +1 more source

The chromatic distinguishing index of certain graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

Criterion‐Related Validity of the Neuropsychological Quick Assessment for Screening Cognitive, Motor, and Behavioral Impairments in Patients With Pediatric Brain Tumors: An Observational Pilot Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Neuropsychological complications may impair the qualitative prognosis of patients with pediatric brain tumors. However, multifaceted evaluations cannot be conducted in all patients because they are time consuming and burdensome for patients.
Ami Tabata   +9 more
wiley   +1 more source

A Note on the Total Detection Numbers of Cycles

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-
Escuadro Henry E.   +2 more
doaj   +1 more source

Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]

open access: yesJisuanji gongcheng, 2017
To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj   +1 more source

Home - About - Disclaimer - Privacy