A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
The reduction of dynamic systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically p...
Paulo Tabuada, Aaron D. Ames, A. Agung Julius, Geo...
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...