—In this paper, we propose two snap-stabilizing distributed algorithms for the committee coordination problem. In this problem, any committee consists of a set of processes and c...
We consider here a model of temporal networks, the links of which are available only at certain moments in time, chosen randomly from a subset of the positive integers. We define...
Eleni C. Akrida, Leszek Gasieniec, George B. Mertz...
: The Sylvester smallest enclosing circle problem involves finding the smallest circle that encloses a finite number of points in the plane. We consider generalized versions of t...
An Thai Nguyen, Daniel Giles, Nguyen Mau Nam, R. B...