Avoidability of long k-abelian repetitions. - Michaël Rao; Matthieu Rosenfeld (CoRR, 2015)

On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. - Michaël Rao; Matthieu Rosenfeld (CoRR, 2015)

Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. - Matthieu Rosenfeld (MFCS, 2016)

Avoidability of long k-abelian repetitions. - Michaël Rao; Matthieu Rosenfeld (Math. Comput., 2016)

Avoidability of Formulas with Two Variables. - Pascal Ochem; Matthieu Rosenfeld (Electron. J. Comb., 2017)

Avoidability of Abelian Repetitions in Words. (Évitabilité des répétitions abéliennes dans les mots). - Matthieu Rosenfeld (2017)

Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ2. - Michaël Rao; Matthieu Rosenfeld (SIAM J. Discret. Math., 2018)

Templates for the k-Binomial Complexity of the Tribonacci Word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (WORDS, 2019)

On Some Interesting Ternary Formulas. - Pascal Ochem; Matthieu Rosenfeld (Electron. J. Comb., 2019)

Bisplit graphs satisfy the Chen-Chvátal conjecture. - Laurent Beaudou; Giacomo Kahn; Matthieu Rosenfeld (Discret. Math. Theor. Comput. Sci., 2019)

Avoidability of Additive Cubes over Alphabets of Four Numbers. - Florian Lietard; Matthieu Rosenfeld (DLT, 2020)

Templates for the k-binomial complexity of the Tribonacci word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Adv. Appl. Math., 2020)

Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree. - Matthieu Rosenfeld (Electron. J. Comb., 2020)

The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable. - Matthieu Rosenfeld (CoRR, 2020)

The binomial equivalence classes of finite words. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Int. J. Algebra Comput., 2020)

How far away must forced letters be so that squares are still avoidable? - Matthieu Rosenfeld (Math. Comput., 2020)

The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. - Matthieu Rosenfeld (SODA, 2021)

Avoidability of Palindrome Patterns. - Pascal Ochem; Matthieu Rosenfeld (Electron. J. Comb., 2021)

Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge. - Matthieu Rosenfeld (Electron. J. Comb., 2021)

Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets. - Matthieu Rosenfeld (Theory Comput. Syst., 2021)

It is undecidable whether the growth rate of a given bilinear system is 1. - Matthieu Rosenfeld (CoRR, 2022)

Avoiding squares over words with lists of size three amongst four symbols. - Matthieu Rosenfeld (Math. Comput., 2022)

Avoiding square-free words on free groups. - Golnaz Badkobeh; Tero Harju; Pascal Ochem; Matthieu Rosenfeld (Theor. Comput. Sci., 2022)

Reconstructing Words Using Queries on Subwords or Factors. - Gwénaël Richomme; Matthieu Rosenfeld (STACS, 2023)

Upper bounds on the average edit distance between two random strings. - Matthieu Rosenfeld (CoRR, 2024)

An explicit condition for boundedly supermultiplicative subshifts. - Vuong Bui; Matthieu Rosenfeld (CoRR, 2024)

Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. - Matthieu Rosenfeld (Eur. J. Comb., 2024)

A Proof of Shur's Conjecture on the Growth of Power-Free Languages over Large Alphabets. - Vuong Bui; Matthieu Rosenfeld (MFCS, 2025)

Local obstructions in sequences revisited. - Matthieu Rosenfeld; Alexander Shen 001 (CoRR, 2025)