Recherche

In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

Hadwiger's conjecture, first formulated in 1943, is a vast generalization of the four-color theorem, and remains one of the central open problems in

Hex is a board game, where two players take turns placing red and blue stones respectively on a rhombus-shaped board with hexagonal cells, with the

Strong flip-flatness has emerged as a natural dense analogue of uniform almost-wideness in the context of preservation theorems, but its combinatorial

In computational biology, phylogenetics is the study of evolutionary histories, their reconstruction from data, their comparison, and interaction

In the Demand Strip Packing problem (DSP), we are given a finite set of axis-aligned rectangular items, each characterized by a specific width and

Given a graph $G$ and an integer $k \geq 2$, let $\chi'_k(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in

In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph