
Local certification of MSO properties for bounded treedepth graphs
The graph model checking problem consists in testing whether an input gr...
read it

Distributed recoloring of interval and chordal graphs
One of the fundamental and moststudied algorithmic problems in distribu...
read it

Local certification of graph decompositions and applications to minorfree classes
Local certification consists in assigning labels to the nodes of a netwo...
read it

(Sub)linear kernels for edge modification problems towards structured graph classes
In a (parameterized) graph edge modification problem, we are given a gra...
read it

TSReconfiguration of Dominating Sets in circle and circulararc graphs
We study the dominating set reconfiguration problem with the token slidi...
read it

Recoloring graphs of treewidth 2
Two (proper) colorings of a graph are adjacent if they differ on exactly...
read it

Asymptotic Dimension of MinorClosed Families and AssouadNagata Dimension of Surfaces
The asymptotic dimension is an invariant of metric spaces introduced by ...
read it

Distributed algorithms for fractional coloring
In this paper we study fractional coloring from the angle of distributed...
read it

On girth and the parameterized complexity of token sliding and token jumping
In the Token Jumping problem we are given a graph G = (V,E) and two inde...
read it

Linear transformations between dominating sets in the TARmodel
Given a graph G and an integer k, a token addition and removal (TAR for ...
read it

Reconfiguration of Spanning Trees with Many or Few Leaves
Let G be a graph and T_1,T_2 be two spanning trees of G. We say that T_1...
read it

Packing and covering balls in graphs excluding a minor
We prove that for every integer t> 1 there exists a constant c_t such th...
read it

A note on the simultaneous edge coloring
Let G=(V,E) be a graph. A (proper) kedgecoloring is a coloring of the ...
read it

When Maximum Stable Set can be solved in FPT time
Maximum Independent Set (MIS for short) is in general graphs the paradig...
read it

Linear transformations between colorings in chordal graphs
Let k and d be such that k > d+2. Consider two kcolorings of a ddegene...
read it

The Perfect Matching Reconfiguration Problem
We study the perfect matching reconfiguration problem: Given two perfect...
read it

A polynomial version of Cereceda's conjecture
Let k and d be such that k > d+2. Consider two kcolourings of a ddegen...
read it

Shortest Reconfiguration of Matchings
Imagine that unlabelled tokens are placed on the edges of a graph, such ...
read it

Parameterized Complexity of Independent Set in HFree Graphs
In this paper, we investigate the complexity of Maximum Independent Set ...
read it

Reconfiguration of graphs with connectivity constraints
A graph G realizes the degree sequence S if the degrees of its vertices ...
read it

Wellposedness conditions in stochastic inversion problems
Stochastic inversion problems arise when it is wanted to estimate the pr...
read it

Detecting and modeling worstcase dependence structures between random inputs of computational reliability models
Uncertain information on input parameters of reliability models is usual...
read it

EPTAS for Max Clique on Disks and Unit Balls
We propose a polynomialtime algorithm which takes as input a finite set...
read it

Distributed coloring in sparse graphs with fewer colors
This paper is concerned with efficiently coloring sparse graphs in the d...
read it

An innovative solution for breast cancer textual big data analysis
The digitalization of stored information in hospitals now allows for the...
read it

Bayesian prior elicitation and selection for extreme values
A major issue of extreme value analysis is the determination of the shap...
read it
Nicolas Bousquet
is this you? claim profile