1 citations · 2 across the 6 of their papers we have counts for
3 papers · 1 filter
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms
Andres Pastrana-Cruz, Manuel Lafond
Several NP-hard problems are solved exactly using exponential-time branching strategies, whether it be branch-and-bound algorithms, or bounded search trees in fixed-parameter algor…
Distributed Pattern Formation in a Ring
Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan +1
Motivated by concerns about diversity in social networks, we consider the following pattern formation problems in rings. Assume mobile agents are located at the nodes of an …
Weak Coverage of a Rectangular Barrier
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +5
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intru…