1. On the structure of run-maximal strings;Baker;J. Discrete Algorithms,2012
2. A computational framework for determining run-maximal strings;Baker;J. Discrete Algorithms,2013
3. H. Bannai, T. I, S. Inenaga, Y. Nakashima, M. Takeda, K. Tsuruta, The Runs” Theorem, 2015 arXiv:1406.0263v6.
4. A d-step approach to the maximum number of distinct squares and runs in strings;Deza;Discrete Appl. Math.,2014
5. A. Deza, F. Franek, Bannai et al., Method Proves the d-step Conjecture for Strings AdvOL-Report 2015/1, McMaster University, 2015.