Michaël Rao

Available identifiers

zbMath Open rao.michaelWikidataQ102317241 ScholiaQ102317241MaRDI QIDQ412261

List of research outcomes

Publication	Date of Publication	Type
An aperiodic set of 11 Wang tiles	2021-11-05	Paper
The 2-domination and Roman domination numbers of grid graphs	2019-08-01	Paper
Avoiding or Limiting Regularities in Words	2019-01-24	Paper
Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$	2018-10-08	Paper
Exhaustive search of convex pentagons which tile the plane	2017-08-01	Paper
On cardinalities of \(k\)-abelian equivalence classes	2016-12-19	Paper
Avoidability of long 𝑘-abelian repetitions	2016-07-25	Paper
On some generalizations of abelian power avoidability	2015-09-16	Paper
On shuffling of infinite square-free words	2015-03-11	Paper
Avoiding 2-binomial squares and cubes	2015-02-24	Paper
Finite repetition threshold for large alphabets	2014-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q3191265	2014-10-01	Paper
Regular simplices and periodic billiard orbits	2014-09-16	Paper
On the number of prime factors of an odd perfect number	2014-09-10	Paper
Infinite square-free self-shuffling words	2014-01-25	Paper
The rank-width of edge-coloured graphs	2013-08-01	Paper
Odd perfect numbers are greater than $10^{1500}$	2012-06-29	Paper
Tree-representation of set families and applications to combinatorial decompositions	2012-05-04	Paper
The Domination Number of Grids	2012-03-15	Paper
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters	2011-12-07	Paper
Distances on rhombus tilings	2011-09-12	Paper
$\mathbb F$ -Rank-Width of (Edge-Colored) Graphs	2011-07-08	Paper
Last cases of Dejean's conjecture	2011-06-16	Paper
Well-quasi-order of relabel functions	2010-11-08	Paper
A note on computing set overlap classes	2010-06-09	Paper
Diamond-free circle graphs are Helly circle	2010-04-27	Paper
Fundamentals of Computation Theory	2010-04-20	Paper
Directed Rank-Width and Displit Decomposition	2010-01-21	Paper
Clique-width of graphs defined by one-vertex extensions	2009-01-28	Paper
Solving some NP-complete problems using split decomposition	2008-10-17	Paper
NLC-2 Graph Recognition and Isomorphism	2008-07-01	Paper
MSOL partitioning problems on graphs of bounded treewidth and clique-width	2007-06-06	Paper
The bi-join decomposition	2007-05-29	Paper
On algorithms for (\(P_5\), gem)-free graphs	2006-03-20	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
How many square occurrences must a binary sequence contain?	2003-05-07	Paper

Research outcomes over time

This page was built for person: Michaël Rao