Scattering number and modular decomposition. - Vassilis Giakoumakis; Florian Roussel; Henri Thuillier (Discret. Math., 1997)

On P4-tidy graphs. - Vassilis Giakoumakis; Florian Roussel; Henri Thuillier (Discret. Math. Theor. Comput. Sci., 1997)

Triangulated Neighbourhoods in C4-Free Berge Graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (WG, 1999)

Holes and Dominoes in Meyniel Graphs. - Florian Roussel; Irena Rusu (Int. J. Found. Comput. Sci., 1999)

On Graphs with Limited Number of P4-Partners. - Florian Roussel; Irena Rusu; Henri Thuillier (Int. J. Found. Comput. Sci., 1999)

A Linear Algorithm to Color i-Triangulated Graphs. - Florian Roussel; Irena Rusu (Inf. Process. Lett., 1999)

Recognizing i-triangulated graphs in O(mn) time. - Florian Roussel; Irena Rusu (Inf. Process. Lett., 2000)

New classes of perfectly orderable graphs. - Jean-Luc Fouquet; Florian Roussel; P. Rubio; Henri Thuillier (Discret. Math., 2001)

An O(n2) algorithm to color Meyniel graphs. - Florian Roussel; Irena Rusu (Discret. Math., 2001)

About Skew Partitions in Minimal Imperfect Graphs. - Florian Roussel; P. Rubio (J. Comb. Theory B, 2001)

Loose vertices in C4-free Berge graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (Discret. Math., 2002)

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. - Florian Roussel; Irena Rusu; Henri Thuillier (Discret. Math., 2009)