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

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

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

A central concept in social choice theory is that of a Condorcet winner: an outcome that defeats every alternative in a pairwise majority vote. While

For a fixed graph H, the H-coloring problem takes as an instance a graph G and asks whether there exists a homomorphism from G to H, i.e., a mapping f

/Talk in french/Exposé en français/ Les graphes fonctionnels sont des graphes dont chaque sommet a un degré sortant exactement égal à 1, et sont ainsi

Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the

Cluster reduction is a technique that can be used to speed up the construction of phylogenetic networks from sets of trees, or so we thought. Baroni