33 citations · 242 across the 67 of their papers we have counts for
8 papers · 1 filter
Shortest Reconfiguration of Matchings
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito +1
Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens…
Frozen -colourings of bounded degree graphs
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Let be a graph of maximum degree and be an integer. The -recolouring graph of is the graph whose vertices are -colourings of and where two -colourings…
Parameterized Complexity of Independent Set in H-Free Graphs
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit +2
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of -free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given…
Reconfiguration of graphs with connectivity constraints
Nicolas Bousquet, Arnaud Mary
A graph realizes the degree sequence if the degrees of its vertices is . Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected mult…
Covariance constraints for stochastic inverse problems of computer models
Nicolas Bousquet, Mélanie Blazère, Thomas Cerbelaud
Stochastic inverse problems considered in this article consist of estimating the probability distributions of intrinsically random inputs of computer models. These estimations are…
Detecting and modeling worst-case dependence structures between random inputs of computational reliability models
Nazih Benoumechiara, Bertrand Michel, Philippe Saint-Pierre +1
Uncertain information on input parameters of reliability models is usually modeled by considering these parameters as random, and described by marginal distributions and a dependen…
EPTAS for Max Clique on Disks and Unit Balls
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +2
We propose a polynomial-time algorithm which takes as input a finite set of points of and compute, up to arbitrary precision, a maximum subset with diameter at most $…
Distributed coloring in sparse graphs with fewer colors
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet +1
This paper is concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar gr…