Badkobeh, Golnaz; Crochemore, Maxime; Ellert, Jonas and Nicaud, Cyril. 2022. 'Back-to-Front Online Lyndon Forest Construction'. In: 33rd Annual Symposium on Combinatorial Pattern Matching. Prague, Czech Republic 27–29 June 2022. [Conference or Workshop Item]

Badkobeh, Golnaz and Crochemore, Maxime. 2022. Linear Construction of a Left Lyndon Tree. Information and Computation, 285(B), 104884. ISSN 0890-5401 [Article]

Badkobeh, Golnaz and Crochemore, Maxime. 2020. Left Lyndon tree construction. Prague Stringology, pp. 84-95. [Article]

Badkobeh, Golnaz; Bannai, Hideo; Crochemore, Maxime; I, Tomohiro; Inenaga, shunsuke and Sugimoto, Shiho. 2019. k-Abelian pattern matching: Revisited, corrected, and extended. pp. 29-40. [Article]

Badkobeh, Golnaz; Crochemore, Maxime and Mercas, Robert. 2017. Counting Maximal-Exponent Factors in Words. Theoretical Computer Science, 658(A), pp. 27-35. ISSN 0304-3975 [Article]

Badkobeh, Golnaz; Crochemore, Maxime; Mohamed, Manal and Toopsuwan, Chalita. 2016. Efficient Computation of Maximal Anti-Exponent in Palindrome-Free Strings. Theoretical Computer Science, 656(B), pp. 241-248. ISSN 0304-3975 [Article]

Badkobeh, Golnaz and Crochemore, Maxime. 2016. Computing maximal-exponent factors in an overlap-free word. Journal of Computer and System Sciences, 82(3), pp. 477-487. ISSN 0022-0000 [Article]

Badkobeh, Golnaz and Crochemore, Maxime. 2015. Infinite binary words containing repetitions of odd period. Information Processing Letters, 115(5), pp. 543-547. ISSN 0020-0190 [Article]