The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michaël Rao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:61-72 [Conf]
  2. Michaël Rao
    Coloring a Graph Using Split Decomposition. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:129-141 [Conf]
  3. Gregory Kucherov, Pascal Ochem, Michaël Rao
    How Many Square Occurrences Must a Binary Sequence Contain? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    On algorithms for (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:2-21 [Journal]
  5. Michaël Rao
    MSOL partitioning problems on graphs of bounded treewidth and clique-width. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:260-267 [Journal]
  6. Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
    NLC-2 graph recognition and isomorphism [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  7. NLC-2 Graph Recognition and Isomorphism. [Citation Graph (, )][DBLP]


  8. Directed Rank-Width and Displit Decomposition. [Citation Graph (, )][DBLP]


  9. A Note On Computing Set Overlap Classes [Citation Graph (, )][DBLP]


  10. Solving some NP-complete problems using split decomposition. [Citation Graph (, )][DBLP]


  11. Clique-width of graphs defined by one-vertex extensions. [Citation Graph (, )][DBLP]


  12. Diamond-free circle graphs are Helly circle. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002