Results 41 to 50 of about 868,385 (332)

Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels

open access: yesDemonstratio Mathematica, 2015
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2:3755· √n.
Januszewski Janusz
doaj   +1 more source

Improving bounds on packing densities of 4-point permutations

open access: yes, 2018
We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342.
Sliacan, Jakub, Stromquist, Walter
core   +1 more source

A list version of graph packing [PDF]

open access: yes, 2015
We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \cup V_{2}, E_{3})$ a bipartite graph.
Győri, Ervin   +3 more
core   +2 more sources

Personalized Selumetinib Dosing in Pediatric Neurofibromatosis Type 1: Insights From a Pilot Therapeutic Drug Monitoring Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács   +8 more
wiley   +1 more source

Packing the Hypercube

open access: yesDiscussiones Mathematicae Graph Theory, 2014
Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, Stout [20] proved that it is possible to pack vertex- disjoint copies of G in Qn so that any proportion r < 1 of the vertices of Qn are covered by the ...
Offner David
doaj   +1 more source

Closing the Gap for Pseudo-Polynomial Strip Packing [PDF]

open access: yes, 2019
Two-dimensional packing problems are a fundamental class of optimization problems and Strip Packing is one of the most natural and famous among them.
Jansen, Klaus, Rau, Malin
core   +2 more sources

The Role of Invasive Procedures in the Treatment of Complicated Gastrointestinal Graft‐Versus‐Host Disease in Pediatric Patients

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Gastrointestinal graft‐versus‐host disease (GI GVHD) following hematopoietic stem cell transplant is typically managed with medical therapy, but surgery and angioembolization may be warranted in selected cases with life‐threatening complications.
Gaia Brunetti   +12 more
wiley   +1 more source

Seven largest trees pack [PDF]

open access: yesOpuscula Mathematica
The Tree Packing Conjecture (TPC) by Gyárfás states that any set of trees \(T_2,\dots,T_{n-1}, T_n\) such that \(T_i\) has \(i\) vertices pack into \(K_n\). The conjecture is true for bounded degree trees, but in general, it is widely open.
Maciej Cisiński, Andrzej Żak
doaj   +1 more source

The sphere packing problem in dimension 24 [PDF]

open access: yes, 2017
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing.
Cohn, H.   +4 more
core   +3 more sources

Home - About - Disclaimer - Privacy