Matthieu Rosenfeld

46 papers A* 1A 1B 2C 2Journal 37Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B conf
A Proof of Shur's Conjecture on the Growth of Power-Free Languages over Large Alphabets.
MFCS
Vuong Bui, Matthieu Rosenfeld
2025 J jnl
An explicit condition for boundedly supermultiplicative subshifts.
Comb. Theory
Vuong Bui, Matthieu Rosenfeld
2025 J jnl
Local obstructions in sequences revisited.
CoRR
Matthieu Rosenfeld, Alexander Shen
2025 J jnl
On Vizing's Problem for Triangle-Free Graphs.
Electron. J. Comb.
Ross J. Kang, Matthieu Rosenfeld
2025 J jnl
The lonely runner conjecture holds for eight runners.
CoRR
Matthieu Rosenfeld
2025 J jnl
The lonely runner conjecture holds for nine runners.
CoRR
Matthieu Rosenfeld
2025 J jnl
Words avoiding the morphic images of most of their factors.
Discret. Math. Theor. Comput. Sci.
Pascal Ochem, Matthieu Rosenfeld
2024 J jnl
An explicit condition for boundedly supermultiplicative subshifts.
CoRR
Vuong Bui, Matthieu Rosenfeld
2024 J jnl
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters.
Eur. J. Comb.
Matthieu Rosenfeld
2024 J jnl
Upper bounds on the average edit distance between two random strings.
CoRR
Matthieu Rosenfeld
2023 A conf
Reconstructing Words Using Queries on Subwords or Factors.
STACS
Gwénaël Richomme, Matthieu Rosenfeld
2023 J jnl
Reconstructing words using queries on subwords or factors.
CoRR
Gwénaël Richomme, Matthieu Rosenfeld
2022 J jnl
Avoiding square-free words on free groups.
Theor. Comput. Sci.
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
2022 J jnl
Avoiding squares over words with lists of size three amongst four symbols.
Math. Comput.
Matthieu Rosenfeld
2022 J jnl
It is undecidable whether the growth rate of a given bilinear system is 1.
CoRR
Matthieu Rosenfeld
2021 J jnl
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters.
CoRR
Matthieu Rosenfeld
2021 J jnl
Avoidability of Palindrome Patterns.
Electron. J. Comb.
Pascal Ochem, Matthieu Rosenfeld
2021 J jnl
Avoiding squares over words with lists of size three amongst four symbols.
CoRR
Matthieu Rosenfeld
2021 J jnl
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets.
Theory Comput. Syst.
Matthieu Rosenfeld
2021 J jnl
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge.
Electron. J. Comb.
Matthieu Rosenfeld
2021 A* conf
The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable.
SODA
Matthieu Rosenfeld
2020 J jnl
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree.
Electron. J. Comb.
Matthieu Rosenfeld
2020 J jnl
Another approach to non-repetitive colorings of graphs of bounded degree.
CoRR
Matthieu Rosenfeld
2020 C conf
Avoidability of Additive Cubes over Alphabets of Four Numbers.
DLT
Florian Lietard, Matthieu Rosenfeld
2020 J jnl
How far away must forced letters be so that squares are still avoidable?
Math. Comput.
Matthieu Rosenfeld
2020 J jnl
Lower-bounds on the growth of power-free languages over large alphabets.
CoRR
Matthieu Rosenfeld
2020 J jnl
On the binomial equivalence classes of finite words.
CoRR
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
2020 J jnl
Templates for the
Adv. Appl. Math.
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
2020 J jnl
The binomial equivalence classes of finite words.
Int. J. Algebra Comput.
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
2020 J jnl
The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable.
CoRR
Matthieu Rosenfeld
2019 J jnl
Bisplit graphs satisfy the Chen-Chvátal conjecture.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
2019 J jnl
How far away must forced letters be so that squares are still avoidable?
CoRR
Matthieu Rosenfeld
2019 J jnl
On Some Interesting Ternary Formulas.
Electron. J. Comb.
Pascal Ochem, Matthieu Rosenfeld
2019 — conf
Templates for the k-Binomial Complexity of the Tribonacci Word.
WORDS
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
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
Bisplit graphs satisfy the Chen-Chvátal conjecture.
CoRR
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
2017 — —
Avoidability of Abelian Repetitions in Words. (Évitabilité des répétitions abéliennes dans les mots).
Matthieu Rosenfeld
2017 J jnl
Avoidability of Formulas with Two Variables.
Electron. J. Comb.
Pascal Ochem, Matthieu Rosenfeld
2017 — conf
On Some Interesting Ternary Formulas.
WORDS
Pascal Ochem, Matthieu Rosenfeld
2017 J jnl
On some interesting ternary formulas.
CoRR
Pascal Ochem, Matthieu Rosenfeld
2016 C conf
Avoidability of Formulas with Two Variables.
DLT
Pascal Ochem, Matthieu Rosenfeld
2016 J jnl
Avoidability of formulas with two variables.
CoRR
Pascal Ochem, Matthieu Rosenfeld
2016 J jnl
Avoidability of long
Math. Comput.
Michaël Rao, Matthieu Rosenfeld
2016 B conf
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable.
MFCS
Matthieu Rosenfeld
2015 J jnl
Avoidability of long k-abelian repetitions.
CoRR
Michaël Rao, Matthieu Rosenfeld
2015 J jnl
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers.
CoRR
Michaël Rao, Matthieu Rosenfeld