The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...
Vassil S. Dimitrov, Jonathan Eskritt, Laurent Imbe...
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...