
Search the dblp DataBase
Michaël Rao:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
Linear Time Algorithms for Some NPComplete Problems on (P_{5}, Gem)Free Graphs. [Citation Graph (0, 0)][DBLP] FCT, 2003, pp:6172 [Conf]
 Michaël Rao
Coloring a Graph Using Split Decomposition. [Citation Graph (0, 0)][DBLP] WG, 2004, pp:129141 [Conf]
 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]
 Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
On algorithms for (P_{5}, gem)free graphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:349, n:1, pp:221 [Journal]
 Michaël Rao
MSOL partitioning problems on graphs of bounded treewidth and cliquewidth. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:377, n:13, pp:260267 [Journal]
 Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
NLC2 graph recognition and isomorphism [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp: [Journal]
NLC2 Graph Recognition and Isomorphism. [Citation Graph (, )][DBLP]
Directed RankWidth and Displit Decomposition. [Citation Graph (, )][DBLP]
A Note On Computing Set Overlap Classes [Citation Graph (, )][DBLP]
Solving some NPcomplete problems using split decomposition. [Citation Graph (, )][DBLP]
Cliquewidth of graphs defined by onevertex extensions. [Citation Graph (, )][DBLP]
Diamondfree circle graphs are Helly circle. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
