We re-visit the complexity of kernelization for the d-Hitting Set proble...
We show that for any permutation π there exists an integer k_π such
that...
In a directed graph D on vertex set v_1,… ,v_n, a forward arc
is an arc ...
We show that every graph with twin-width t has chromatic number O(ω
^k_t...
Dallard, Milanič, and Štorgel [arXiv '22] ask if for every class
excludi...
The independent set reconfiguration problem asks whether one can transfo...
We provide a O(k^2 log k) vertex kernel for cograph edge editing.
This i...
The dichromatic number of an oriented graph is the minimum size of a
par...
We continue developing the theory around the twin-width of totally order...
We characterise the classes of tournaments with tractable first-order mo...
A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...
Twin-width is a recently introduced graph parameter with applications in...
We introduce the notion of delineation. A graph class 𝒞 is said
delineat...
A contraction sequence of a graph consists of iteratively merging two of...
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
We study the existence of polynomial kernels, for parameterized problems...
Inspired by a width invariant defined on permutations by Guillemot and M...
We establish a list of characterizations of bounded twin-width for
hered...
We recently introduced the graph invariant twin-width, and showed that
f...
The twin-width of a graph G is the minimum integer d such that G has a
d...
Inspired by a width invariant defined on permutations by Guillemot and M...
We study the approximability of the Maximum Independent Set (MIS) proble...
A hole in a graph is an induced cycle with at least 4 vertices. A
graph ...
Maximum Independent Set (MIS for short) is in general graphs the paradig...
In the Maximum Independent Set problem we are asked to find a set of pai...
We show that there exist convex n-gons P and Q such that the largest
con...
A hole in a graph is an induced cycle of length at least 4, and an antih...
In this paper, we investigate the complexity of Maximum Independent Set ...
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A p...
We propose a polynomial-time algorithm which takes as input a finite set...
We study a restricted form of list colouring, for which every pair of li...