A discrete Fourier kernel and Fraenkel's tiling conjecture
A local minimum energy condition of hexagonal circle packing.
A new sphere packing in 20 dimensions.
A note on a two dimensional knapsack problem with unloading constraints
In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin B, and a list L of n rectangular items, each item with a class value in {1,...,C}. The problem is to pack a subset of L into B, maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item a, items with higher class values can not block a. We present a (4 + ϵ)-approximation algorithm when the bin is a square. We also present (3 + ϵ)-approximation...
A survey on packing and covering problems in the Hamming permutation space.
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Asymptotically optimal box packing theorems.
Asymptotically optimal tree-packings in regular graphs.