The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Florian Roussel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Igor Parfenoff, Florian Roussel, Irena Rusu
    Triangulated Neighbourhoods in C4-Free Berge Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:402-412 [Conf]
  2. Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier
    New classes of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:95-109 [Journal]
  3. Igor Parfenoff, Florian Roussel, Irena Rusu
    Loose vertices in C4-free Berge graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:137-160 [Journal]
  4. Florian Roussel, Irena Rusu
    An O(n2) algorithm to color Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:107-123 [Journal]
  5. Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
    On P4-tidy graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1997, v:1, n:1, pp:17-41 [Journal]
  6. Florian Roussel, Irena Rusu
    Holes and Dominoes in Meyniel Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:127-146 [Journal]
  7. Florian Roussel, Irena Rusu, Henri Thuillier
    On Graphs with Limited Number of P4-Partners. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:103-0 [Journal]
  8. Florian Roussel, Irena Rusu
    Recognizing i-triangulated graphs in O(mn) time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:3, pp:141-147 [Journal]
  9. Florian Roussel, Irena Rusu
    A Linear Algorithm to Color i-Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:2, pp:57-62 [Journal]
  10. Florian Roussel, P. Rubio
    About Skew Partitions in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:171-190 [Journal]
  11. Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
    Scattering number and modular decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:321-342 [Journal]

  12. The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002