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.
Boundary of the union of rectangles in the plane
Given rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.
Circle-packing connections with random walks and a finite volume method
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.
Class-uniformly resolvable group divisible structures. II: Frames.
Construction of minimal bracketing covers for rectangles.
Correction to the paper: Packing of 180 equal circles on a sphere. Elemente der Mathematik. Vol. 38, 1983, 119-122.
Covering Sets by Subsets.
Covering the Plane with Convex Polygons.
Covering with rectangular pieces.
Coverings Sets for Plane Lattices.
Décompositions d'un intervalle réel et des ensembles de Cantor
Dělové koule a včelí plásty