Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. - Golnaz Badkobeh; Maxime Crochemore (Stringology, 2010)

Hunting Redundancies in Strings. - Golnaz Badkobeh; Supaporn Chairungsee; Maxime Crochemore (Developments in Language Theory, 2011)

Finite-Repetition threshold for infinite ternary words - Golnaz Badkobeh; Maxime Crochemore (WORDS, 2011)

Fewest repetitions versus maximal-exponent powers in infinite binary words. - Golnaz Badkobeh (Theor. Comput. Sci., 2011)

Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. - Golnaz Badkobeh; Maxime Crochemore; Chalita Toopsuwan (SPIRE, 2012)

Binary Jumbled String Matching: Faster Indexing in Less Space - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (CoRR, 2012)

Fewest repetitions in infinite binary words. - Golnaz Badkobeh; Maxime Crochemore (RAIRO Theor. Informatics Appl., 2012)

A Note on Words With the Smallest Number of Closed Factors - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (CoRR, 2013)

Binary jumbled string matching for highly run-length compressible texts. - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (Inf. Process. Lett., 2013)

Infinite words containing the minimal number of repetitions. - Golnaz Badkobeh (J. Discrete Algorithms, 2013)

Avoiding redundancies in words. - Golnaz Badkobeh (2013)

Maximal anti-exponent of gapped palindromes. - Golnaz Badkobeh; Maxime Crochemore; Chalita Toopsuwan (DICTAP, 2014)

Unbiased Black-Box Complexity of Parallel Search. - Golnaz Badkobeh; Per Kristian Lehre; Dirk Sudholt (PPSN, 2014)

Finite repetition threshold for large alphabets. - Golnaz Badkobeh; Maxime Crochemore; Michaël Rao (RAIRO Theor. Informatics Appl., 2014)

Black-box Complexity of Parallel Search with Distributed Populations. - Golnaz Badkobeh; Per Kristian Lehre; Dirk Sudholt (FOGA, 2015)

On the Number of Closed Factors in a Word. - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (LATA, 2015)

Infinite binary words containing repetitions of odd period. - Golnaz Badkobeh; Maxime Crochemore (Inf. Process. Lett., 2015)

Characterization of some binary words with few squares. - Golnaz Badkobeh; Pascal Ochem (Theor. Comput. Sci., 2015)

Longest Common Abelian Factors and Large Alphabets. - Golnaz Badkobeh; Travis Gagie; Szymon Grabowski; Yuto Nakashima 001; Simon J. Puglisi; Shiho Sugimoto (SPIRE, 2016)

Closed factorization. - Golnaz Badkobeh; Hideo Bannai; Keisuke Goto 001; Tomohiro I; Costas S. Iliopoulos; Shunsuke Inenaga; Simon J. Puglisi; Shiho Sugimoto (Discret. Appl. Math., 2016)

Computing maximal-exponent factors in an overlap-free word. - Golnaz Badkobeh; Maxime Crochemore (J. Comput. Syst. Sci., 2016)

Efficient computation of maximal anti-exponent in palindrome-free strings. - Golnaz Badkobeh; Maxime Crochemore; Manal Mohamed 001; Chalita Toopsuwan (Theor. Comput. Sci., 2016)

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. - Golnaz Badkobeh; Travis Gagie; Shunsuke Inenaga; Tomasz Kociumaka; Dmitry Kosolobov; Simon J. Puglisi (SPIRE, 2017)

On Suffix Tree Breadth. - Golnaz Badkobeh; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova (SPIRE, 2017)

Counting maximal-exponent factors in words. - Golnaz Badkobeh; Maxime Crochemore; Robert Mercas (Theor. Comput. Sci., 2017)

Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words. - Tim Crawford; Golnaz Badkobeh; David Lewis 003 (ISMIR, 2018)

Algorithms for anti-powers in strings. - Golnaz Badkobeh; Gabriele Fici; Simon J. Puglisi (Inf. Process. Lett., 2018)

Computing the Antiperiod(s) of a String. - Hayam Alamro; Golnaz Badkobeh; Djamal Belazzougui; Costas S. Iliopoulos; Simon J. Puglisi (CPM, 2019)

Constructing Antidictionaries in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (DCC, 2019)

k-Abelian Pattern Matching: Revisited, Corrected, and Extended. - Golnaz Badkobeh; Hideo Bannai; Maxime Crochemore; Tomohiro I; Shunsuke Inenaga; Shiho Sugimoto (Stringology, 2019)

Left Lyndon Tree Construction. - Golnaz Badkobeh; Maxime Crochemore (Stringology, 2020)

Avoiding conjugacy classes on the 5-letter alphabet. - Golnaz Badkobeh; Pascal Ochem (RAIRO Theor. Informatics Appl., 2020)

Internal Shortest Absent Word Queries. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Solon P. Pissis (CPM, 2021)

Constructing Antidictionaries of Long Texts in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (Theory Comput. Syst., 2021)

Tight upper and lower bounds on suffix tree breadth. - Golnaz Badkobeh; Pawel Gawrychowski; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova (Theor. Comput. Sci., 2021)

Back-To-Front Online Lyndon Forest Construction. - Golnaz Badkobeh; Maxime Crochemore; Jonas Ellert; Cyril Nicaud (CPM, 2022)

On Compressing Collections of Substring Samples. - Golnaz Badkobeh; Sara Giuliani; Zsuzsanna Lipták; Simon J. Puglisi (ICTCS, 2022)

Maximal Closed Substrings. - Golnaz Badkobeh; Alessandro De Luca 002; Gabriele Fici; Simon J. Puglisi (SPIRE, 2022)

Linear construction of a left Lyndon tree. - Golnaz Badkobeh; Maxime Crochemore (Inf. Comput., 2022)

Internal shortest absent word queries in constant time and linear space. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Dmitry Kosolobov; Solon P. Pissis (Theor. Comput. Sci., 2022)

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

Bijective BWT Based Compression Schemes. - Golnaz Badkobeh; Hideo Bannai; Dominik Köppl (SPIRE, 2024)

On Practical Data Structures for Sorted Range Reporting. - Golnaz Badkobeh; Sehar Naveed; Simon J. Puglisi (PSC, 2024)