We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...