3 papers
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
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 …
quant-ph2025
Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors
Pierre Cazals, Aymeric François, Loïc Henriet +9
The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processor…