Professor Golnaz Badkobeh
Contact details
About
Overview
Prof. Golnaz Badkobeh is the Head of Department of Computer Science.
Golnaz's research has two main themes: combinatorial aspects of repetition in sequential data, and algorithmic and data structural problems in string processing. Her most significant research contribution to date is a series of intricate combinatorial results concerning pattern avoidance and strong constraints on strings. This is of crucial importance in computer science in particular for designing efficient pattern matching methods and text compression techniques.
Qualifications
- PhD in Informatics, King's College London, United Kingdom, 2009 - 2012
- BSc Mathematics, University of Bristol, United Kingdom, 2005 - 2008
Employment
- Senior Lecturer /Deputy Head, Goldsmiths University of London, United Kingdom, 2017 - 2023
- Leverhulme Early Career Fellow, University of Warwick, United Kingdom, 2015 - 2017
- Research Associate, University of Sheffield, United Kingdom, 2014 - 2015
Publications
Publications by category
Conference papers and proceedings (3)
- Badkobeh, G., Bannai, H. and Köppl, D. Bijective BWT Based Compression Schemes. .doi:10.1007/978-3-031-72200-4_2
- Badkobeh, G., Crochemore, M., Ellert, J. and Nicaud, C. (2022). Back-To-Front Online Lyndon Forest Construction. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022) 27-29 June, Czech Republic.doi:10.4230/LIPIcs.CPM.2022.13
- Badkobeh, G., De Luca, A., Fici, G. and Puglisi, S.J. Maximal Closed Substrings. .doi:10.1007/978-3-031-20643-6_2
Journal articles (5)
- Badkobeh, G. and Ochem, P. (2026). More characterizations of morphic words. Theoretical Computer Science, 1072, pp. 115875-115875. doi:10.1016/j.tcs.2026.115875
- Badkobeh, G., De Luca, A., Fici, G. and Puglisi, S.J. (2026). Finding maximal closed substrings. Theoretical Computer Science, 1060, pp. 115628-115628. doi:10.1016/j.tcs.2025.115628
- Badkobeh, G., Harju, T., Ochem, P. and Rosenfeld, M. (2022). Avoiding square-free words on free groups. Theoretical Computer Science, 922, pp. 206-217. doi:10.1016/j.tcs.2022.04.025
- Badkobeh, G., Charalampopoulos, P., Kosolobov, D. and Pissis, S.P. (2022). Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. doi:10.1016/j.tcs.2022.04.029
- Badkobeh, G. and Crochemore, M. (2022). Linear construction of a left Lyndon tree. Information and Computation, 285. doi:10.1016/j.ic.2022.104884