Unbiased black-box complexity of parallel search G Badkobeh, PK Lehre, D Sudholt International Conference on Parallel Problem Solving from Nature, 892-901, 2014 | 40 | 2014 |

Binary jumbled string matching for highly run-length compressible texts G Badkobeh, G Fici, S Kroon, Z Lipták Information Processing Letters 113 (17), 604-608, 2013 | 26 | 2013 |

Toward a unifying framework for evolutionary processes T Paixăo, G Badkobeh, N Barton, D Çörüş, DC Dang, T Friedrich, ... Journal of Theoretical Biology 383, 28-43, 2015 | 21 | 2015 |

Computing the maximal-exponent repeats of an overlap-free string in linear time G Badkobeh, M Crochemore, C Toopsuwan International Symposium on String Processing and Information Retrieval, 61-72, 2012 | 21 | 2012 |

Black-box complexity of parallel search with distributed populations G Badkobeh, PK Lehre, D Sudholt Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms …, 2015 | 19 | 2015 |

Finite-Repetition threshold for infinite ternary words G Badkobeh, M Crochemore arXiv preprint arXiv:1108.3619, 2011 | 11 | 2011 |

Closed factorization G Badkobeh, H Bannai, K Goto, I Tomohiro, CS Iliopoulos, S Inenaga, ... Discrete Applied Mathematics 212, 23-29, 2016 | 10 | 2016 |

On the number of closed factors in a word G Badkobeh, G Fici, Z Lipták International Conference on Language and Automata Theory and Applications …, 2015 | 10 | 2015 |

Algorithms for anti-powers in strings G Badkobeh, G Fici, SJ Puglisi Information Processing Letters 137, 57-60, 2018 | 9 | 2018 |

Finite repetition threshold for large alphabets G Badkobeh, M Crochemore, M Rao RAIRO-Theoretical Informatics and Applications 48 (4), 419-430, 2014 | 9 | 2014 |

Fewest repetitions in infinite binary words G Badkobeh, M Crochemore RAIRO-Theoretical Informatics and Applications 46 (1), 17-31, 2012 | 9 | 2012 |

Hunting redundancies in strings G Badkobeh, S Chairungsee, M Crochemore International Conference on Developments in Language Theory, 1-14, 2011 | 8 | 2011 |

Searching page-images of early music scanned with OMR: a scalable solution using minimal absent words T Crawford, G Badkobeh, D Lewis Goldsmiths, University of London, 2018 | 7 | 2018 |

Longest common Abelian factors and large alphabets G Badkobeh, T Gagie, S Grabowski, Y Nakashima, SJ Puglisi, S Sugimoto International Symposium on String Processing and Information Retrieval, 254-259, 2016 | 6 | 2016 |

Fewest repetitions versus maximal-exponent powers in infinite binary words G Badkobeh Theoretical computer science 412 (48), 6625-6633, 2011 | 6 | 2011 |

A note on words with the smallest number of closed factors G Badkobeh, G Fici, Z Lipták CoRR abs/1305.6395, 2013 | 5 | 2013 |

Binary jumbled string matching: Faster indexing in less space G Badkobeh, G Fici, S Kroon, Z Lipták arXiv preprint arXiv:1206.2523, 2012 | 5 | 2012 |

Computing maximal-exponent factors in an overlap-free word G Badkobeh, M Crochemore Journal of Computer and System Sciences 82 (3), 477-487, 2016 | 4 | 2016 |

Characterization of some binary words with few squares G Badkobeh, P Ochem Theoretical Computer Science 588, 73-80, 2015 | 4 | 2015 |

Maximal anti-exponent of gapped palindromes G Badkobeh, M Crochemore, C Toopsuwan 2014 Fourth International Conference on Digital Information and …, 2014 | 2 | 2014 |