Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. - Hans L. Bodlaender; Andreas Brandstädt; Dieter Kratsch; Michaël Rao; Jeremy P. Spinrad (FCT, 2003)

How Many Square Occurrences Must a Binary Sequence Contain? - Gregory Kucherov; Pascal Ochem; Michaël Rao (Electron. J. Comb., 2003)

Coloring a Graph Using Split Decomposition. - Michaël Rao (WG, 2004)

The bi-join decomposition. - Fabien de Montgolfier; Michaël Rao (Electron. Notes Discret. Math., 2005)

On algorithms for (P5, gem)-free graphs. - Hans L. Bodlaender; Andreas Brandstädt; Dieter Kratsch; Michaël Rao; Jeremy P. Spinrad (Theor. Comput. Sci., 2005)

Décompositions de graphes et algorithmes efficaces. - Michaël Rao (2006)

NLC-2 Graph Recognition and Isomorphism. - Vincent Limouzy; Fabien de Montgolfier; Michaël Rao (WG, 2007)

MSOL partitioning problems on graphs of bounded treewidth and clique-width. - Michaël Rao (Theor. Comput. Sci., 2007)

Solving some NP-complete problems using split decomposition. - Michaël Rao (Discret. Appl. Math., 2008)

Clique-width of graphs defined by one-vertex extensions. - Michaël Rao (Discret. Math., 2008)

A note on computing set overlap classes. - Pierre Charbit; Michel Habib; Vincent Limouzy; Fabien de Montgolfier; Mathieu Raffinot; Michaël Rao (Inf. Process. Lett., 2008)

Directed Rank-Width and Displit Decomposition. - Mamadou Moustapha Kanté; Michaël Rao (WG, 2009)

Clique-Width and the Speed of Hereditary Properties. - Peter Allen 001; Vadim V. Lozin; Michaël Rao (Electron. J. Comb., 2009)

Diamond-free circle graphs are Helly circle. - Jean Daligault; Daniel Gonçalves 001; Michaël Rao (Discret. Math., 2010)

Well-Quasi-Order of Relabel Functions. - Jean Daligault; Michaël Rao; Stéphan Thomassé (Order, 2010)

mathbb F mathbb F-Rank-Width of (Edge-Colored) Graphs. - Mamadou Moustapha Kanté; Michaël Rao (CAI, 2011)

The Domination Number of Grids. - Daniel Gonçalves 001; Alexandre Pinlou; Michaël Rao; Stéphan Thomassé (SIAM J. Discret. Math., 2011)

Distances on rhombus tilings. - Olivier Bodini; Thomas Fernique; Michaël Rao; Eric Rémila (Theor. Comput. Sci., 2011)

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. - Roman Kolpakov; Michaël Rao (Theor. Comput. Sci., 2011)

Last cases of Dejean's conjecture. - Michaël Rao (Theor. Comput. Sci., 2011)

Tree-representation of set families and applications to combinatorial decompositions. - Binh-Minh Bui-Xuan; Michel Habib; Michaël Rao (Eur. J. Comb., 2012)

Odd perfect numbers are greater than 101500. - Pascal Ochem; Michaël Rao (Math. Comput., 2012)

The Rank-Width of Edge-Coloured Graphs. - Mamadou Moustapha Kanté; Michaël Rao (Theory Comput. Syst., 2013)

Infinite square-free self-shuffling words. - Mike Müller; Svetlana Puzynina; Michaël Rao (CoRR, 2014)

Finite repetition threshold for large alphabets. - Golnaz Badkobeh; Maxime Crochemore; Michaël Rao (RAIRO Theor. Informatics Appl., 2014)

On the number of prime factors of an odd perfect number. - Pascal Ochem; Michaël Rao (Math. Comput., 2014)

On Shuffling of Infinite Square-Free Words. - Mike Müller; Svetlana Puzynina; Michaël Rao (Electron. J. Comb., 2015)

An aperiodic set of 11 Wang tiles. - Emmanuel Jeandel; Michaël Rao (CoRR, 2015)

Avoidability of long k-abelian repetitions. - Michaël Rao; Matthieu Rosenfeld (CoRR, 2015)

On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. - Michaël Rao; Matthieu Rosenfeld (CoRR, 2015)

On some generalizations of abelian power avoidability. - Michaël Rao (Theor. Comput. Sci., 2015)

Avoiding 2-binomial squares and cubes. - Michaël Rao; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2015)

Avoidability of long k-abelian repetitions. - Michaël Rao; Matthieu Rosenfeld (Math. Comput., 2016)

Preuves aidées par ordinateur en combinatoire des mots. - Michaël Rao (2017)

On cardinalities of k-abelian equivalence classes. - Juhani Karhumäki; Svetlana Puzynina; Michaël Rao; Markus A. Whiteland (Theor. Comput. Sci., 2017)

Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ2. - Michaël Rao; Matthieu Rosenfeld (SIAM J. Discret. Math., 2018)

The 2-domination and Roman domination numbers of grid graphs. - Michaël Rao; Alexandre Talon (Discret. Math. Theor. Comput. Sci., 2019)

Testing Balanced Splitting Cycles in Complete Triangulations. - Vincent Despré; Michaël Rao; Stéphan Thomassé (CCCG, 2020)

Ants on the highway. - Anahí Gajardo; Victor H. Lutfalla; Michaël Rao (CoRR, 2024)

Recovery of cyclic words by their subwords. - Sergey Luchinin; Svetlana Puzynina; Michaël Rao (CoRR, 2024)