We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
In hyperfine structure examinations, routine high resolution spectroscopy methods have to be combined with exact fine structure calculations. The so-called magnetic A and electric...
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-...