Michaël Rao

49 papers B 4Journal 41Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Recovery of cyclic words by their subwords.
Eur. J. Comb.
Sergey Luchinin, Svetlana Puzynina, Michaël Rao
2025 J jnl
Ants on the highway.
Nat. Comput.
Anahí Gajardo, Victor H. Lutfalla, Michaël Rao
2024 J jnl
Ants on the highway.
CoRR
Anahí Gajardo, Victor H. Lutfalla, Michaël Rao
2024 J jnl
Recovery of cyclic words by their subwords.
CoRR
Sergey Luchinin, Svetlana Puzynina, Michaël Rao
2020 — conf
Testing Balanced Splitting Cycles in Complete Triangulations.
CCCG
Vincent Despré, Michaël Rao, Stéphan Thomassé
2019 J jnl
The 2-domination and Roman domination numbers of grid graphs.
Discret. Math. Theor. Comput. Sci.
Michaël Rao, Alexandre Talon
2018 J jnl
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ
SIAM J. Discret. Math.
Michaël Rao, Matthieu Rosenfeld
2018 J jnl
The 2-domination and Roman domination numbers of grid graphs.
CoRR
Michaël Rao, Alexandre Talon
2017 J jnl
On cardinalities of k-abelian equivalence classes.
Theor. Comput. Sci.
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
2017 — book
Preuves aidées par ordinateur en combinatoire des mots.
Michaël Rao
2016 J jnl
Avoidability of long
Math. Comput.
Michaël Rao, Matthieu Rosenfeld
2016 J jnl
On cardinalities of k-abelian equivalence classes.
CoRR
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
2015 J jnl
An aperiodic set of 11 Wang tiles.
CoRR
Emmanuel Jeandel, Michaël Rao
2015 J jnl
Avoidability of long k-abelian repetitions.
CoRR
Michaël Rao, Matthieu Rosenfeld
2015 J jnl
Avoiding 2-binomial squares and cubes.
Theor. Comput. Sci.
Michaël Rao, Michel Rigo, Pavel Salimov
2015 J jnl
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers.
CoRR
Michaël Rao, Matthieu Rosenfeld
2015 J jnl
On Shuffling of Infinite Square-Free Words.
Electron. J. Comb.
Mike Müller, Svetlana Puzynina, Michaël Rao
2015 J jnl
On some generalizations of abelian power avoidability.
Theor. Comput. Sci.
Michaël Rao
2014 J jnl
Finite repetition threshold for large alphabets.
RAIRO Theor. Informatics Appl.
Golnaz Badkobeh, Maxime Crochemore, Michaël Rao
2014 J jnl
Infinite square-free self-shuffling words.
CoRR
Mike Müller, Svetlana Puzynina, Michaël Rao
2014 J jnl
On the number of prime factors of an odd perfect number.
Math. Comput.
Pascal Ochem, Michaël Rao
2013 J jnl
Avoiding 2-binomial squares and cubes.
CoRR
Michaël Rao, Michel Rigo, Pavel Salimov
2013 J jnl
The Rank-Width of Edge-Coloured Graphs.
Theory Comput. Syst.
Mamadou Moustapha Kanté, Michaël Rao
2012 J jnl
Odd perfect numbers are greater than 10
Math. Comput.
Pascal Ochem, Michaël Rao
2012 J jnl
Tree-representation of set families and applications to combinatorial decompositions.
Eur. J. Comb.
Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
2011 J jnl
Distances on rhombus tilings.
Theor. Comput. Sci.
Olivier Bodini, Thomas Fernique, Michaël Rao, Eric Rémila
2011 J jnl
Last cases of Dejean's conjecture.
Theor. Comput. Sci.
Michaël Rao
2011 J jnl
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
CoRR
Roman Kolpakov, Michaël Rao
2011 J jnl
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters.
Theor. Comput. Sci.
Roman Kolpakov, Michaël Rao
2011 J jnl
The Domination Number of Grids
CoRR
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2011 J jnl
The Domination Number of Grids.
SIAM J. Discret. Math.
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2011 — conf
\mathbb
CAI
Mamadou Moustapha Kanté, Michaël Rao
2010 J jnl
Diamond-free circle graphs are Helly circle.
Discret. Math.
Jean Daligault, Daniel Gonçalves, Michaël Rao
2010 J jnl
Well-Quasi-Order of Relabel Functions.
Order
Jean Daligault, Michaël Rao, Stéphan Thomassé
2009 J jnl
Clique-Width and the Speed of Hereditary Properties.
Electron. J. Comb.
Peter Allen, Vadim V. Lozin, Michaël Rao
2009 B conf
Directed Rank-Width and Displit Decomposition.
WG
Mamadou Moustapha Kanté, Michaël Rao
2008 J jnl
A note on computing set overlap classes.
Inf. Process. Lett.
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2008 J jnl
Clique-width of graphs defined by one-vertex extensions.
Discret. Math.
Michaël Rao
2008 J jnl
Solving some NP-complete problems using split decomposition.
Discret. Appl. Math.
Michaël Rao
2007 J jnl
A Note On Computing Set Overlap Classes
CoRR
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2007 J jnl
MSOL partitioning problems on graphs of bounded treewidth and clique-width.
Theor. Comput. Sci.
Michaël Rao
2007 B conf
NLC-2 Graph Recognition and Isomorphism.
WG
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
2007 J jnl
NLC-2 graph recognition and isomorphism
CoRR
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
2006 — —
Décompositions de graphes et algorithmes efficaces.
Michaël Rao
2005 J jnl
On algorithms for (
Theor. Comput. Sci.
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2005 J jnl
The bi-join decomposition.
Electron. Notes Discret. Math.
Fabien de Montgolfier, Michaël Rao
2004 B conf
Coloring a Graph Using Split Decomposition.
WG
Michaël Rao
2003 J jnl
How Many Square Occurrences Must a Binary Sequence Contain?
Electron. J. Comb.
Gregory Kucherov, Pascal Ochem, Michaël Rao
2003 B conf
Linear Time Algorithms for Some NP-Complete Problems on (P
FCT
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad