![]() ![]() | Rosenfeld, M. (2020). How far away must forced letters be so that squares are still avoidable? Mathematics of Computation, 89 (326), 3057-3071. doi:10.1090/MCOM/3535 ![]() |
![]() ![]() | Lejeune, M., Rigo, M., & Rosenfeld, M. (2020). Templates for the k-binomial complexity of the Tribonacci word. Advances in Applied Mathematics, 112. doi:10.1016/j.aam.2019.101947 ![]() |
![]() ![]() | Lejeune, M., Rigo, M., & Rosenfeld, M. (September 2019). Templates for the k-binomial complexity of the Tribonacci word. Lecture Notes in Computer Science, 11682, 238-250. doi:10.1007/978-3-030-28796-2_19 ![]() |
![]() ![]() | Lejeune, M., Rigo, M., & Rosenfeld, M. (2019). Templates for the k-binomial complexity of the Tribonacci word. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/234215. |
![]() ![]() | Beaudou, L., Kahn, G., & Rosenfeld, M. (2019). Bisplit graphs satisfy the Chen-Chvátal conjecture. Discrete Mathematics and Theoretical Computer Science, 21 (1), 5509. ![]() |