… We have also studied the (g-packing problems for various families (g, [20]-[23], [28], [29];
other recent works can also be viewed in this light [1]-[3], [8]-[ 10], [34]. In particular, for any …

… problem: a given graph G is to be “packed” into a host graph H, and we are asked about some
natural optimization questions concerning this packing… on bipartite graphs the algorithm is …

… problem can be modeled as an instance of an mebp problem by constructing a bipartite
graph, … In particular, we are interested in very unbalanced bipartite graphs (ie, R is much larger …

… bipartite graph between W and WI based on whether two nodes can be identified or not. Now
the problem is simply finding a matching in this auxiliary graph… , define a bipartite graph Bf …

… We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable. … problem
of existence of a matching or a hamiltonian cycle in a bipartite graph is, in fact, a problem …

… Note that W ⊆ R, and consider the induced bipartite graph H with parts W and S \ T. We
depict this situation in Figure 1. As G is cubic and every vertex u ∈ W has a neighbor in Q and a …

… However, using approximation results for the maximum weighted 3-packing problem (mainly
based on local search techniques) [1], we can obtain a ( 1 2 - ε ) -approximation for MAXW …

… Let K k , ℓ be the complete bipartite graph with partition classes of size k and ℓ , respectively.
… of the problem that tests whether a given bipartite graph has a perfect S ( K k , ℓ ) -packing. …

… bipartite graphs, … packing variant, this question becomes even harder. In this paper, we
study the correspondence‐ and list‐packing numbers of (asymmetric) complete bipartite graphs. …

… -bipartite graphs … graphs, we have that each W~ is near-bipartite. We show that besides the
clique inequalities, the rank facets of near-bipartite graphs correspond (essentially) to graphs …