33 citations · 242 across the 67 of their papers we have counts for
83 papers
Metric dimension parameterized by treewidth in chordal graphs
Nicolas Bousquet, Quentin Deschamps, Aline Parreau
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A re…
A note on the flip distance between non-crossing spanning trees
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni +1
We consider spanning trees of points in convex position whose edges are pairwise non-crossing. Applying a flip to such a tree consists in adding an edge and removing another so…
On the coalitional decomposition of parameters of interest
Marouane Il Idrissi, Nicolas Bousquet, Fabrice Gamboa +2
Understanding the behavior of a black-box model with probabilistic inputs can be based on the decomposition of a parameter of interest (e.g., its variance) into contributions attri…
Extremal Independent Set Reconfiguration
Nicolas Bousquet, Bastien Durain, Théo Pierron +1
The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the inte…
Digraph redicolouring
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse +2
Given two -dicolourings of a digraph , we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while…
A note on highly connected -minor free graphs
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
We show that every -connected -minor free graph with minimum degree at least has maximum degree at most . As a consequence, we show that every 3-connected…