Michaël Rao

According to our database, Michaël Rao authored at least 39 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Ants on the highway.

Anahí Gajardo, Victor H. Lutfalla, Michaël Rao

CoRR, 2024

2020

Testing Balanced Splitting Cycles in Complete Triangulations.

Vincent Despré, Michaël Rao, Stéphan Thomassé

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

The 2-domination and Roman domination numbers of grid graphs.

Michaël Rao, Alexandre Talon

Discret. Math. Theor. Comput. Sci., 2019

2018

Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ².

Michaël Rao, Matthieu Rosenfeld

SIAM J. Discret. Math., 2018

2017

On cardinalities of k-abelian equivalence classes.

Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland

Theor. Comput. Sci., 2017

Preuves aidées par ordinateur en combinatoire des mots.

Michaël Rao

, 2017

2016

Avoidability of long <i>k</i>-abelian repetitions.

Michaël Rao, Matthieu Rosenfeld

Math. Comput., 2016

2015

Avoiding 2-binomial squares and cubes.

Michaël Rao, Michel Rigo, Pavel Salimov

Theor. Comput. Sci., 2015

On some generalizations of abelian power avoidability.

Michaël Rao

Theor. Comput. Sci., 2015

On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers.

Michaël Rao, Matthieu Rosenfeld

CoRR, 2015

Avoidability of long k-abelian repetitions.

Michaël Rao, Matthieu Rosenfeld

CoRR, 2015

An aperiodic set of 11 Wang tiles.

Emmanuel Jeandel, Michaël Rao

CoRR, 2015

On Shuffling of Infinite Square-Free Words.

Mike Müller, Svetlana Puzynina, Michaël Rao

Electron. J. Comb., 2015

2014

On the number of prime factors of an odd perfect number.

Pascal Ochem, Michaël Rao

Math. Comput., 2014

Finite repetition threshold for large alphabets.

Golnaz Badkobeh, Maxime Crochemore, Michaël Rao

RAIRO Theor. Informatics Appl., 2014

Infinite square-free self-shuffling words.

Mike Müller, Svetlana Puzynina, Michaël Rao

CoRR, 2014

2013

The Rank-Width of Edge-Coloured Graphs.

Mamadou Moustapha Kanté, Michaël Rao

Theory Comput. Syst., 2013

2012

Odd perfect numbers are greater than 10¹⁵⁰⁰.

Pascal Ochem, Michaël Rao

Math. Comput., 2012

Tree-representation of set families and applications to combinatorial decompositions.

Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao

Eur. J. Comb., 2012

2011

Last cases of Dejean's conjecture.

Michaël Rao

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

Distances on rhombus tilings.

Olivier Bodini, Thomas Fernique, Michaël Rao, Eric Rémila

Theor. Comput. Sci., 2011

The Domination Number of Grids.

Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé

SIAM J. Discret. Math., 2011

\mathbb <i>F</i>\mathbb F-Rank-Width of (Edge-Colored) Graphs.

Mamadou Moustapha Kanté, Michaël Rao

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010

Well-Quasi-Order of Relabel Functions.

Jean Daligault, Michaël Rao, Stéphan Thomassé

Order, 2010

Diamond-free circle graphs are Helly circle.

Jean Daligault, Daniel Gonçalves, Michaël Rao

Discret. Math., 2010

2009

Clique-Width and the Speed of Hereditary Properties.

Peter Allen, Vadim V. Lozin, Michaël Rao

Electron. J. Comb., 2009

Directed Rank-Width and Displit Decomposition.

Mamadou Moustapha Kanté, Michaël Rao

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

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

Clique-width of graphs defined by one-vertex extensions.

Michaël Rao

Discret. Math., 2008

Solving some NP-complete problems using split decomposition.

Michaël Rao

Discret. Appl. Math., 2008

2007

MSOL partitioning problems on graphs of bounded treewidth and clique-width.

Michaël Rao

Theor. Comput. Sci., 2007

NLC-2 Graph Recognition and Isomorphism.

Vincent Limouzy, Fabien de Montgolfier, Michaël Rao

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Décompositions de graphes et algorithmes efficaces.

Michaël Rao

PhD thesis, 2006

2005

On algorithms for (<i>P</i>₅, gem)-free graphs.

Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad

Theor. Comput. Sci., 2005

The bi-join decomposition.

Fabien de Montgolfier, Michaël Rao

Electron. Notes Discret. Math., 2005

2004

Coloring a Graph Using Split Decomposition.

Michaël Rao

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

How Many Square Occurrences Must a Binary Sequence Contain?

Gregory Kucherov, Pascal Ochem, Michaël Rao

Electron. J. Comb., 2003

Linear Time Algorithms for Some NP-Complete Problems on (P₅, Gem)-Free Graphs.

Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003