Matthieu Rosenfeld
Matthieu Rosenfeld
Post-doc (ATER) at Lis (Marseille, France)
Подтвержден адрес электронной почты в домене uliege.be - Главная страница
Название
Процитировано
Процитировано
Год
Avoidability of long 𝑘-abelian repetitions
M Rao, M Rosenfeld
Mathematics of Computation 85 (302), 3051-3060, 2016
142016
Avoiding Two Consecutive Blocks of Same Size and Same Sum over
M Rao, M Rosenfeld
SIAM Journal on Discrete Mathematics 32 (4), 2381-2397, 2018
9*2018
Avoidability of abelian repetitions in words
M Rosenfeld
Université de Lyon, 2017
52017
Every binary pattern of length greater than 14 is Abelian-2-avoidable
M Rosenfeld
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
52016
Another approach to non-repetitive colorings of graphs of bounded degree
M Rosenfeld
arXiv preprint arXiv:2006.09094, 2020
42020
Avoidability of formulas with two variables
P Ochem, M Rosenfeld
The Electronic Journal of Combinatorics 24 (4), 4-30, 2017
42017
Bisplit graphs satisfy the Chen-Chv\'atal conjecture
L Beaudou, G Kahn, M Rosenfeld
arXiv preprint arXiv:1808.08710, 2018
32018
Bounding the number of -dominating sets in trees, forests and graphs of bounded pathwidth
M Rosenfeld
arXiv preprint arXiv:1904.02943, 2019
22019
On some interesting ternary formulas
P Ochem, M Rosenfeld
International Conference on Combinatorics on Words, 30-35, 2017
22017
Avoidability of formulas with two variables
P Ochem, M Rosenfeld
International Conference on Developments in Language Theory, 344-354, 2016
22016
The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable
M Rosenfeld
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
12021
Templates for the k-Binomial Complexity of the Tribonacci Word
M Lejeune, M Rigo, M Rosenfeld
International Conference on Combinatorics on Words, 238-250, 2019
12019
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
M Rosenfeld
arXiv preprint arXiv:2102.00750, 2021
2021
Avoidability of palindrome patterns
P Ochem, M Rosenfeld
The Electronic Journal of Combinatorics, P1. 4-P1. 4, 2021
2021
Lower-bounds on the growth of power-free languages over large alphabets
M Rosenfeld
arXiv preprint arXiv:2008.05192, 2020
2020
Nice formulas, $ xyx $-formulas, and palindrome patterns
P Ochem, M Rosenfeld
arXiv preprint arXiv:2005.05505, 2020
2020
Avoidability of Additive Cubes over Alphabets of Four Numbers
F Lietard, M Rosenfeld
International Conference on Developments in Language Theory, 192-206, 2020
2020
On the binomial equivalence classes of finite words
M Lejeune, M Rigo, M Rosenfeld
arXiv preprint arXiv:2001.11732, 2020
2020
Templates for the k-binomial complexity of the Tribonacci word
M Lejeune, M Rigo, M Rosenfeld
Advances in Applied Mathematics 112, 101947, 2020
2020
How far away must forced letters be so that squares are still avoidable?
M Rosenfeld
Mathematics of Computation 89 (326), 3057-3071, 2020
2020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20