| 2008 |
|---|
| 12 | EE | Michaël Rao:
Solving some NP-complete problems using split decomposition.
Discrete Applied Mathematics 156(14): 2768-2780 (2008) |
| 11 | EE | Michaël Rao:
Clique-width of graphs defined by one-vertex extensions.
Discrete Mathematics 308(24): 6157-6165 (2008) |
| 10 | EE | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A note on computing set overlap classes.
Inf. Process. Lett. 108(4): 186-191 (2008) |
| 2007 |
|---|
| 9 | EE | Vincent Limouzy,
Fabien de Montgolfier,
Michaël Rao:
NLC-2 Graph Recognition and Isomorphism.
WG 2007: 86-98 |
| 8 | EE | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A Note On Computing Set Overlap Classes
CoRR abs/0711.4573: (2007) |
| 7 | EE | Vincent Limouzy,
Fabien de Montgolfier,
Michaël Rao:
NLC-2 graph recognition and isomorphism
CoRR abs/cs/0703013: (2007) |
| 6 | EE | Michaël Rao:
MSOL partitioning problems on graphs of bounded treewidth and clique-width.
Theor. Comput. Sci. 377(1-3): 260-267 (2007) |
| 2005 |
|---|
| 5 | EE | Fabien de Montgolfier,
Michaël Rao:
The bi-join decomposition.
Electronic Notes in Discrete Mathematics 22: 173-177 (2005) |
| 4 | EE | Hans L. Bodlaender,
Andreas Brandstädt,
Dieter Kratsch,
Michaël Rao,
Jeremy Spinrad:
On algorithms for (P5, gem)-free graphs.
Theor. Comput. Sci. 349(1): 2-21 (2005) |
| 2004 |
|---|
| 3 | EE | Michaël Rao:
Coloring a Graph Using Split Decomposition.
WG 2004: 129-141 |
| 2003 |
|---|
| 2 | EE | 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.
FCT 2003: 61-72 |
| 1 | EE | Gregory Kucherov,
Pascal Ochem,
Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain?
Electr. J. Comb. 10: (2003) |
