Manuscrits/Soumis

• Michaël Rao, Alexandre Talon:
  The 2-domination and Roman domination numbers of grid graphs (arXiv)
• Michael Rao:
  Exhaustive search of convex pentagons which tile the plane (arXiv) (draft) (slides) (preliminary version of the code)
  
• Emmanuel Jeandel, Michael Rao:
  An aperiodic set of 11 Wang tiles (arXiv)
  
• Michaël Rao, Elise Vaslet:
  Dejean words with frequency constraint. (ps)

Publications

• Michael Rao, Matthieu Rosenfeld:
  Avoiding two consecutive blocks of same size and same sum over Z²
  SIAM J. Discrete Math., 32(4), pp. 2381-2397. (2018) (doi) (arXiv)
  
• Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
  On cardinalities of k-abelian equivalence classes
  Theoretical Computer Science, (2016) (doi) (arXiv)
  
• Michael Rao, Matthieu Rosenfeld
  Avoidability of long k-abelian repetitions
  Mathematics of Computation, Volume 85 (2016), pp. 3051-3060. (doi) (arXiv)
  short version in proceedings of Mons Days of Theoretical Computer Science. Nancy, 2014 (html)
  
• Michaël Rao:
  On some generalizations of abelian power avoidability
  Theoretical Computer Science, Special issue of WORDS 2013, Volume 601, pp. 39-46. (doi) (pdf)
• Mike Müller, Svetlana Puzynina, Michaël Rao:
  On Shuffling of Infinite Square-Free Words
  The Electronic Journal of Combinatorics 22(1) (2015), Paper 1.55 (html) (arXiv)
  
• Michaël Rao, Michel Rigo, Pavel Salimov:
  Avoiding 2-binomial squares and cubes
  Theoretical Computer Science, Volume 572 (2015), pp. 83-91. (doi) (arXiv)
  
• Pascal Ochem, Michaël Rao:
  Another remark on the radical of an odd perfect number (pdf)
  The Fibonacci Quarterly Vol 52(3) (2014), pp. 215-217.
• Pascal Ochem, Michaël Rao:
  On the number of prime factors of an odd perfect number (doi) (pdf)
  Mathematics of Computation Vol 83 (2014), pp. 2435-2439.
• Nicolas Bedaride, Michael Rao:
  Regular simplices and periodic billiard orbits
  Proceedings of the American Mathematical Society Vol 142 (2014), pp. 3511-3519. (doi) (arXiv)
  
• Golnaz Badkobeh, Maxime Crochemore, Michaël Rao;
  Finite-repetition threshold for large alphabets
  RAIRO - Theoretical Informatics and Applications Vol 48(4) (2014), pp. 419-430, (pdf)
  short version in proceedings of the Mons Days of Theoretical Computer Science. Louvain-La-Neuve, September 11-14, 2012.
• Mamadou Moustapha Kanté, Michaël Rao:
  The Rank-Width of Edge-Colored Graphs
  Theory of Computing Systems Vol 52(4) (2013), pp. 599-644. (doi) (arXiv)
  short version in proceedings of CAI 2011, LNCS vol. 6742(2011), pp 158-173.
• Pascal Ochem, Michaël Rao:
  Odd perfect numbers are greater than 10¹⁵⁰⁰
  Mathematics of Computation Vol 81 (2012), pp. 1869-1877 (doi) (link)
• Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
  Tree-representation of set families and applications to combinatorial decompositions
  European Journal of Combinatorics Vol. 33(5) (2012), pp. 688-711 (doi) (pdf)
• Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
  The Domination Number of Grids
  SIAM J. Discrete Math. Vol. 25 (2011) pp. 1443-1453. (doi) (arXiv)
• Roman Kolpakov, Michaël Rao:
  On the number of Dejan words over alphabets of 5, 6, 7, 8, 9 and 10 letters
  Theoretical Computer Science , Vol. 412(46) (2011) pp. 6507-6516. (doi) (arXiv)
  
• Olivier Bodini, Thomas Fernique, Michael Rao, Éric Rémila:
  Distances on Rhombus Tilings
  Theoretical Computer Science, Vol. 412 (36) (2011), pp. 4787-4794 (doi) (pdf)
• Michaël Rao:
  Last Cases of Dejean's Conjecture
  Theoretical Computer Science, Vol. 412(27) (2011) pp. 3010-3018. (ps) (doi)
  short version in proceedings of WORDS 2009.
• Jean Daligault, Michaël Rao, Stéphan Thomassé:
  Well-quasi-order of relabel functions
  Order, Vol. 27(3) (2010) pp. 301-315. (doi)
  short version in ROGICS 08. (pdf)
• Mamadou Moustapha Kanté, Michaël Rao:
  Directed Rank-Width and Displit Decomposition
  Proceedings of WG 09, LNCS 5911, pp. 214-225 (ps)
• Jean Daligault, Daniel Gonçalves, Michaël Rao:
  Diamond-free Circle Graphs are Helly Circle
  Discrete Mathematics, Vol. 310(4) (2009) pp. 845-849. (doi)
• Peter Allen, Vadim Lozin, Michaël Rao
  Clique-Width and the Speed of Hereditary Properties
  The Electronic Journal of Combinatorics, Vol. 16(1) (2009). (html)
• Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien De Montgolfier, Mathieu Raffinot, Michaël Rao:
  A Note On Computing Set Overlap Classes
  Information Processing Letters, Vol. 108(4) (2008) pp. 186-191. (arXiv) (doi) (source code)
• Pascal Ochem, Michaël Rao:
  Minimum frequencies of occurrences of squares and letters in infinite words
  Mons Days of Theoretical Computer Science. Mons, August 27-30, 2008. (pdf)
• Michaël Rao:
  Clique-width of graphs defined by one-vertex extensions
  Discrete Mathematics, Vol. 308(24) (2008) pp. 6157-6165. (ps) (doi)
• Michaël Rao:
  Solving some NP-complete problems using split decomposition
  Discrete Applied Mathematics, Vol. 156(14) (2008) pp. 2768-2780. (ps) (doi)
  (short version Coloring a graph using split decomposition in Proceedings of WG 2004, LNCS Vol. 3353 pp. 129-141. ps)
• Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
  NLC-2 graph recognition and isomorphism.
  Proceedings of WG 2007, LNCS Vol. 4769 pp. 86-98. Springer-Verlag, Berlin. (HAL)
• Michaël Rao:
  MSOL partitioning problems on graphs of bounded treewidth and clique-width
  Theoretical Computer Science, Vol. 377(1-3) (2007) pp. 260-267. (ps) (doi)
• Fabien de Montgolfier, Michaël Rao:
  The Bi-join Decomposition
  Proceedings of ICGT'05 (7th International Colloquium on Graph Theory), The Electronic Notes in Discrete Mathematics, 22 (2005) pp. 173-177. (ps)
• Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad:
  On algorithms for (P5,gem)-free graphs
  Theoretical Computer Science, Vol. 349(1) (2005) pp. 2-21. (doi) (ps)
  (short version Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs in Proceedings of FCT 2003, LNCS Vol. 2751 pp. 61-72. ps)
• Gregory Kucherov, Pascal Ochem, Michaël Rao
  How many square occurrences must a binary sequence contain?
  The Electronic Journal of Combinatorics, Vol. 10 (2003). (html)

Non publiés

• Fabien de Montgolfier, Michaël Rao:
  Bipartitives families and the bi-join decomposition (HAL)
• Michaël Rao:
  Decomposition of (gem,co-gem)-free graphs (ps)
• Michaël Rao:
  New decompositions of 2-structures (HAL)

HDR

• Preuves aidées par ordinateur en combinatoire des mots
  Soutenue le 27 juin 2017 à l'ENS de Lyon. pdf
  Jury: S. Brlek, A. Carpi. M Crochemore, J. Kari, M. Sablik, B. Salvy, L. Vuillon.

Thèse

• Décompositions de graphes et algorithmes efficaces.
  Soutenue le 16 juin 2006 à l'Université de Metz.
  Jury: J. Fonlupt (président), V. Chepoi (rapporteur), M. Habib (rapporteur), D. Kratsch (directeur), A. Brandstädt, G. Kucherov.
  ps pdf