Michaël Rao

Publication Activity (10 Years)

Years Active: 2003-2020
Publications (10 Years): 13

Top Venues

CoRR

Math. Comput.

Theor. Comput. Sci.

Theory Comput. Syst.

University of Metz, France (PHD)

Education History

University of Metz, France

PHD

Publications

Vincent Despré, Michaël Rao, Stéphan Thomassé
Testing Balanced Splitting Cycles in Complete Triangulations. CCCG (2020)
Michaël Rao, Alexandre Talon
The 2-domination and Roman domination numbers of grid graphs. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Michaël Rao, Matthieu Rosenfeld
. SIAM J. Discret. Math. 32 (4) (2018)
Michaël Rao, Alexandre Talon
The 2-domination and Roman domination numbers of grid graphs. CoRR (2018)
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. Theor. Comput. Sci. 658 (2017)
Michaël Rao, Matthieu Rosenfeld
-abelian repetitions. Math. Comput. 85 (302) (2016)
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. CoRR (2016)
Emmanuel Jeandel, Michaël Rao
An aperiodic set of 11 Wang tiles. CoRR (2015)
Michaël Rao, Michel Rigo, Pavel Salimov
Avoiding 2-binomial squares and cubes. Theor. Comput. Sci. 572 (2015)
Michaël Rao
On some generalizations of abelian power avoidability. Theor. Comput. Sci. 601 (2015)
Michaël Rao, Matthieu Rosenfeld
Avoidability of long k-abelian repetitions. CoRR (2015)
Mike Müller, Svetlana Puzynina, Michaël Rao
On Shuffling of Infinite Square-Free Words. Electron. J. Comb. 22 (1) (2015)
Michaël Rao, Matthieu Rosenfeld
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. CoRR (2015)
Pascal Ochem, Michaël Rao
On the number of prime factors of an odd perfect number. Math. Comput. 83 (289) (2014)
Golnaz Badkobeh, Maxime Crochemore, Michaël Rao
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Mike Müller, Svetlana Puzynina, Michaël Rao
Infinite square-free self-shuffling words. CoRR (2014)
Michaël Rao, Michel Rigo, Pavel Salimov
Avoiding 2-binomial squares and cubes. CoRR (2013)
Mamadou Moustapha Kanté, Michaël Rao
The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. 52 (4) (2013)
Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33 (5) (2012)
Pascal Ochem, Michaël Rao
. Math. Comput. 81 (279) (2012)
Olivier Bodini, Thomas Fernique, Michaël Rao, Eric Rémila
Distances on rhombus tilings. Theor. Comput. Sci. 412 (36) (2011)
Roman Kolpakov, Michaël Rao
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters CoRR (2011)
Michaël Rao
Last cases of Dejean's conjecture. Theor. Comput. Sci. 412 (27) (2011)
Roman Kolpakov, Michaël Rao
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. Theor. Comput. Sci. 412 (46) (2011)
Mamadou Moustapha Kanté, Michaël Rao
\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI (2011)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids CoRR (2011)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids. SIAM J. Discret. Math. 25 (3) (2011)
Jean Daligault, Michaël Rao, Stéphan Thomassé
Well-Quasi-Order of Relabel Functions. Order 27 (3) (2010)
Jean Daligault, Daniel Gonçalves, Michaël Rao
Diamond-free circle graphs are Helly circle. Discret. Math. 310 (4) (2010)
Peter Allen, Vadim V. Lozin, Michaël Rao
Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. 16 (1) (2009)
Mamadou Moustapha Kanté, Michaël Rao
Directed Rank-Width and Displit Decomposition. WG (2009)
Michaël Rao
Solving some NP-complete problems using split decomposition. Discret. Appl. Math. 156 (14) (2008)
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) (2008)
Michaël Rao
Clique-width of graphs defined by one-vertex extensions. Discret. Math. 308 (24) (2008)
Michaël Rao
MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377 (1-3) (2007)
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
NLC-2 Graph Recognition and Isomorphism. WG (2007)
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
NLC-2 graph recognition and isomorphism CoRR (2007)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A Note On Computing Set Overlap Classes CoRR (2007)
Fabien de Montgolfier, Michaël Rao
The bi-join decomposition. Electron. Notes Discret. Math. 22 (2005)
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
, gem)-free graphs. Theor. Comput. Sci. 349 (1) (2005)
Michaël Rao
Coloring a Graph Using Split Decomposition. WG (2004)
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
, Gem)-Free Graphs. FCT (2003)
Gregory Kucherov, Pascal Ochem, Michaël Rao
How Many Square Occurrences Must a Binary Sequence Contain? Electron. J. Comb. 10 (2003)

Michaël Rao.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michaël Rao