33 citations · 242 across the 67 of their papers we have counts for
6 papers · 1 filter
Bayesian prior elicitation and selection for extreme values
Nicolas Bousquet, Merlin Keller
A major issue of extreme value analysis is the determination of the shape parameter common to Generalized Extreme Value (GEV) and Generalized Pareto (GP) distributions, which d…
Token Jumping in minor-closed classes
Nicolas Bousquet, Arnaud Mary, Aline Parreau
Given two -independent sets and of a graph , one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex…
Computing maximum cliques in -EPG graphs
Nicolas Bousquet, Marc Heinrich
EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class -EPG is the subclass of EPG graphs where the path on…
A proof of the Erdős-Sands-Sauer-Woodrow conjecture
N. Bousquet, W. Lochet, S. Thomassé
A very nice result of Bárány and Lehel asserts that every finite subset or can be covered by -boxes (i.e. each box has two antipodal points in ). As…
Decomposition techniques applied to the Clique-Stable set Separation problem
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray +1
In a graph, a Clique-Stable Set separator (CS-separator) is a family of cuts (bipartitions of the vertex set) such that for every clique and every stable set …
Exact distance coloring in trees
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan +1
For an integer and an even integer , consider the graph obtained from a large complete -ary tree by connecting with an edge any two vertices at distance exactly …