1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
Malory Marin, Jean-Florent Raymond, Rémi Watrigant
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in . In this setting…
cs.DS2025
Subcoloring of (Unit) Disk Graphs
Malory Marin, Rémi Watrigant
A subcoloring of a graph is a partition of its vertex set into subsets (called colors), each inducing a disjoint union of cliques. It is a natural generalization of the classical p…
cs.DS2024★ 1 cited
Channel allocation revisited through 1-extendability of graphs
Anthony Busson, Malory Marin, Rémi Watrigant
We revisit the classical problem of channel allocation for Wi-Fi access points (AP). Using mechanisms such as the CSMA/CA protocol, Wi-Fi access points which are in conflict within…