Florian Roussel

12 papers B 1Journal 11
YearRankTypeTitle / Venue / Authors
2009 J jnl
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution.
Discret. Math.
Florian Roussel, Irena Rusu, Henri Thuillier
2002 J jnl
Loose vertices in
Discret. Math.
Igor Parfenoff, Florian Roussel, Irena Rusu
2001 J jnl
About Skew Partitions in Minimal Imperfect Graphs.
J. Comb. Theory B
Florian Roussel, P. Rubio
2001 J jnl
An O(
Discret. Math.
Florian Roussel, Irena Rusu
2001 J jnl
New classes of perfectly orderable graphs.
Discret. Math.
Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier
2000 J jnl
Recognizing i-triangulated graphs in O(mn) time.
Inf. Process. Lett.
Florian Roussel, Irena Rusu
1999 J jnl
A Linear Algorithm to Color
Inf. Process. Lett.
Florian Roussel, Irena Rusu
1999 J jnl
Holes and Dominoes in Meyniel Graphs.
Int. J. Found. Comput. Sci.
Florian Roussel, Irena Rusu
1999 J jnl
On Graphs with Limited Number of P
Int. J. Found. Comput. Sci.
Florian Roussel, Irena Rusu, Henri Thuillier
1999 B conf
Triangulated Neighbourhoods in
WG
Igor Parfenoff, Florian Roussel, Irena Rusu
1997 J jnl
On P
Discret. Math. Theor. Comput. Sci.
Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
1997 J jnl
Scattering number and modular decomposition.
Discret. Math.
Vassilis Giakoumakis, Florian Roussel, Henri Thuillier