Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a
P. Di Francesco, Paul Zinn-Justin, Jean-Bernard Zu...