We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...