Home
Research
Teaching
Links





Research

Decomposition of graphs, graph theory, structural graph theory, FPT algorithms, algebraic operations and related problems. My current researches are focused on clique-width and equivalent complexity measures such as rank-width, m-clique-width or NLC-width of directed as well as undirected graphs. I am also interested in the Transversal problem which consists in enumerating all minimal hitting sets of a hypergraph in time polynomial in the number of minimal hitting sets. We have shown that this later problem is the same as enumerating all minimal dominating sets in a graph in time polynomial in the number of minimal dominating sets. I am also interested in convexity spaces derived from betweenness relations, particularly those related to graphs.

Papers

Talks

Thesis



Updated December 2015