An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Support for efficient multicasting in WLANs can enable new services such as streaming TV channels, radio channels, and visitor's information. With increasing deployments of l...