1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
Malory Marin, Rémi Watrigant
While most classical NP-hard graph problems cannot be solved in time on general graphs under the Exponential Time Hypothesis (ETH), many exhibit the square-root phenomen…
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…
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
Malory Marin
Given a graph , the hard-core model defines a probability distribution over its independent sets, assigning to each set of size a probability of , where …
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…