Publications

Journal Articles

1. Golnaz Badkobeh, Pawel Gawrychowski, Juha Kärkkäinen, Simon J. Puglisi, and Bella Zhukova. Tight Upper and Lower Bounds on Suffix Tree Breadth. Theoretical Computer Science. 2020.

2. Golnaz Badkobeh and Pascal Ochem. Avoiding conjugacy classes on the 5-letter alphabet. RAIRO -Theoretical Informatics and Applications. 2020. 

3. Golnaz Badkobeh, Gabriele Fici, and Simon J. Puglisi. Algorithms for anti-powers in strings. Information Processing Letters. 137: 57-60, 2018. 

4. Golnaz Badkobeh, Maxime Crochemore, and Robert Marcaş. Counting Maximal-Exponent Factors in Words. Theoretical Computer Science, 658:27-35, 2017.

5. Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, and Chalita Toopsuwan. Linear Time Algorithm for Finding Maximum Anti-Exponent of Gapped Palindromes. Theoretical Computer Science, 656: 241-248, 2016.

6. Golnaz Badkobeh and Maxime Crochemore. Maximal-exponent Factors in Strings. Journal of Computer and System Sciences, 82(3):477-487, 2016.

7. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos , Shunsuke Inenaga , Simon J. Puglisi, and Shiho Sugimoto. Closed Factorization. Discrete Applied Mathematics, 212: 23-29, 2016.

8. Golnaz Badkobeh and Pascal Ochem. Characterization of some Binary Words with Few Squares. Theoretical Computer Science, 588:73-80, 2015. 

9. Golnaz Badkobeh and Maxime Crochemore. Infinite Binary Words Containing Repetitions of Odd Period Repetitions. Information Processing Letters, 115(5):543-547, 2015. 

10. Tiago Paixão, Golnaz Badkobeh, Nick Barton, Doğan Çörüş, Duc-Cuong Dang, Tobias Friedrich, Per Kristian Lehre, Dirk Sudholt, Andrew M. Sutton, Barbora Trubenová. Toward a unifying framework for evolutionary processes. Journal of theoretical biology 383: 28-43, 2015.

11. Golnaz Badkobeh, Michaël Rao, and Maxime Crochemore. Finite-Repetition Threshold for Large Alphabets. RAIRO-Theoretical Informatics and Applications, 48(4):419-430. 2014.

12. Golnaz Badkobeh, Gabriele Fici, Steve Kroon, and Zsuzsanna Lipták. Binary Jumbled String Matching for Highly Run-Length Compressible Texts. Information Processing Letters, 113(17):604–608, 2013.

13. Golnaz Badkobeh. Infinite Words Containing Minimal Number of Repetitions. Journal of Discrete Algorithms, 20:38–42, 2013.

14. Golnaz Badkobeh and Maxime Crochemore. Fewest Repetitions in Infinite Binary Words. RAIRO- Theoretical Informatics and Applications, 46(1):1–31, 2012.

15. Golnaz Badkobeh. Fewest Repetitions vs Maximal-Exponent Powers in Infinite Binary Words. Theoretical Computer Science, 412(48):6625–6633, 2011.                                              

 Refereed Conference Papers

1. Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga and Shiho Sugimoto. k-Abelian pattern matching: Revisited, corrected, and extended. In Prague Stringology Conference, 2019.

2. Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Háliou, Solon P. Pissis Constructing Antidictionaries in Output-Sensitive Space. In Data Compression Conference, 538-547, 2019.

3. Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi: Computing the Antiperiod(s) of a String. In 30th Annual Symposium on Combinatorial Pattern Matching, 32:1-11, 2019. 

4. Tim Crawford, Golnaz Badkobeh and David Lewis. Searching Page-Image of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words. In 19th International Society for Music Information Retrieval Conference, 2018. 

5. Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi: On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.In 24th International Symposium on String Processing and Information Retrieval 51-67, 2017.

6. Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova:On Suffix Tree Breadth. In 24th International Symposium on String Processing and Information Retrieval: 68-73, 2017.

7. Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon Puglisi and Shiho Sugimoto.

8. Longest Common Abelian Factors and Large Alphabets. In 23rd International Symposium on String Processing and Information Retrieval: 254-259, 2016.

9. Golnaz Badkobeh, Gabriele Fici, and Zsuzsanna Lipták. On the Number of Closed Factors in a Word. In 9th International Conference on Language and Automata Theory and Applications (LATA), 381-390, 2015.

10. Golnaz Badkobeh, Dirk Sudholt, and Per Kristian Lehre. Black-box Complexity of Parallel Search with Distributed Populations. In 13th International Conference on Foundations of Genetic Algorithms, 3-15, 2015.

11. Golnaz Badkobeh, Dirk Sudholt, and Per Kristian Lehre. Unbiased Black-Box Complexity of Parallel Search. In 13th International Conference on Parallel Problem Solving from Nature (PPSN ), 892-901, 2014. 

12. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos , Shunsuke Inenaga , Simon J. Puglisi, and Shiho Sugimoto. Closed Factorization. In The Prague Stringology Conference, 162-168, 2014.

13. Golnaz Badkobeh, Maxime Crochemore, and Chalita Toopsuwan. Computing the Maximal- Exponent Repeats of an Overlap-free String in Linear Time. In E. C. L. Calderon Benavides, C. Gonzlez-Caro and N. Ziviani, editors, Symposium on String Processing and Information Retrieval, number 7608 in LNCS, pages 61–72. Springer, 2012. Awarded the Best Paper of SPIRE 2012.

14. Golnaz Badkobeh, Michaël Rao, and Maxime Crochemore. Finite-Repetition Threshold for Large Alphabets. In Proc. 14th Mons Days of Theoretical Computer Science, 2012.

15. Golnaz Badkobeh, Supaporn Chairungsee, and Maxime Crochemore. Hunting Redundancies in Strings. In Proc. Developments in Language Theory, pages 1–14, 2011.

    1. Golnaz Badkobeh and Maxime Crochemore. Finite-Repetition Threshold for Infinite Ternary Words. In Proc. WORDS, pages 37–43, 2011.