The notion of k-limited packing in a graph is a generalization of 2-packing. For a given non negative integer k, a subset B of vertices is a k-limited packing if there are at most k elements of B in the closed neighborhood ...

Given a positive integer k, the {k}-packing function problem ({k}PF) is to find in a given graph G, a function f of maximum weight that assigns a non-negative integer to the vertices of G in such a way that the sum of f(v) ...

The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between ...

A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i + 1. To compute the packing chromatic number is NP-hard, even restricted to trees, and it is known ...

Given a positive integer k and a graph G, a k-limited packing in G is a subset B of its vertex set such that each closed vertex neighborhood of G has at most k vertices of B (Gallant et al., 2010). A first generalization ...

A general mathematical model was developed for predicting the performance and simulation of a packed-bed immobilized enzyme reactor performing a reaction that follows Michaelis–Menten kinetics with competitive product ...

The object of this study is a particular case of the cutting and packing problems, known as container loading problems. These problems consist in arranging rectangular boxes orthogonally into containers (or into trucks, ...

Although tissue cooling is widely used in the treatment of musculoskeletal disorders there is still controversy about its effects on muscular performance. It is important to study this issue since cooling is also combined ...

A dispersion of wormlike micelles, empirically found in some block copolymer (BCP) / epoxy blends, has been reported to produce a significant toughening of epoxy networks. In this study, a rationale procedure to generate ...