Michaël Rao

According to our database1, Michaël Rao authored at least 38 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Testing Balanced Splitting Cycles in Complete Triangulations.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
The 2-domination and Roman domination numbers of grid graphs.
Discret. Math. Theor. Comput. Sci., 2019

2018
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ<sup>2</sup>.
SIAM J. Discret. Math., 2018

2017
On cardinalities of k-abelian equivalence classes.
Theor. Comput. Sci., 2017

Preuves aidées par ordinateur en combinatoire des mots.
, 2017

2016
Avoidability of long <i>k</i>-abelian repetitions.
Math. Comput., 2016

2015
Avoiding 2-binomial squares and cubes.
Theor. Comput. Sci., 2015

On some generalizations of abelian power avoidability.
Theor. Comput. Sci., 2015

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

Avoidability of long k-abelian repetitions.
CoRR, 2015

An aperiodic set of 11 Wang tiles.
CoRR, 2015

On Shuffling of Infinite Square-Free Words.
Electron. J. Comb., 2015

2014
On the number of prime factors of an odd perfect number.
Math. Comput., 2014

Finite repetition threshold for large alphabets.
RAIRO Theor. Informatics Appl., 2014

Infinite square-free self-shuffling words.
CoRR, 2014

2013
The Rank-Width of Edge-Coloured Graphs.
Theory Comput. Syst., 2013

2012
Odd perfect numbers are greater than 10<sup>1500</sup>.
Math. Comput., 2012

Tree-representation of set families and applications to combinatorial decompositions.
Eur. J. Comb., 2012

2011
Last cases of Dejean's conjecture.
Theor. Comput. Sci., 2011

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters.
Theor. Comput. Sci., 2011

Distances on rhombus tilings.
Theor. Comput. Sci., 2011

The Domination Number of Grids.
SIAM J. Discret. Math., 2011

\mathbb <i>F</i>\mathbb F-Rank-Width of (Edge-Colored) Graphs.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010
Well-Quasi-Order of Relabel Functions.
Order, 2010

Diamond-free circle graphs are Helly circle.
Discret. Math., 2010

2009
Clique-Width and the Speed of Hereditary Properties.
Electron. J. Comb., 2009

Directed Rank-Width and Displit Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
A note on computing set overlap classes.
Inf. Process. Lett., 2008

Clique-width of graphs defined by one-vertex extensions.
Discret. Math., 2008

Solving some NP-complete problems using split decomposition.
Discret. Appl. Math., 2008

2007
MSOL partitioning problems on graphs of bounded treewidth and clique-width.
Theor. Comput. Sci., 2007

NLC-2 Graph Recognition and Isomorphism.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006
Décompositions de graphes et algorithmes efficaces.
PhD thesis, 2006

2005
On algorithms for (<i>P</i><sub>5</sub>, gem)-free graphs.
Theor. Comput. Sci., 2005

The bi-join decomposition.
Electron. Notes Discret. Math., 2005

2004
Coloring a Graph Using Split Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003
How Many Square Occurrences Must a Binary Sequence Contain?
Electron. J. Comb., 2003

Linear Time Algorithms for Some NP-Complete Problems on (P<sub>5</sub>, Gem)-Free Graphs.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003


  Loading...