1 citations · 1 across the 3 of their papers we have counts for
3 papers
Fixed-parameter tractability of counting small minimum -cuts
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel +1
The parameterized complexity of counting minimum cuts stands as a natural question because Ball and Provan showed its #P-completeness. For any undirected graph and two di…
The Authorization Policy Existence Problem
Pierre Bergé, Jason Crampton, Gregory Gutin +1
Constraints such as separation-of-duty are widely used to specify requirements that supplement basic authorization policies. However, the existence of constraints (and authorizatio…
On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs
Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel +1
The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the \textit{1D-move} perturbation to improve the spac…