publication venue for
- Inferring an indeterminate string from a prefix graph 2015
- Editorial. 52-53:1-1. 2018
- String covering with optimal covers. 51:26-38. 2018
- Lyndon array construction during Burrows–Wheeler inversion. 50:2-9. 2018
- An improved upper bound and algorithm for clique covers. 48:42-56. 2018
- A prefix array for parameterized strings. 42:23-34. 2017
- Corrigendum to “On a lemma of Crochemore and Rytter” [Journal of Discrete Algorithms 34 (2015) 18–22]. 38-41:50-51. 2016
- Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].. 38-41:50-51. 2016
- On a lemma of Crochemore and Rytter. 34:18-22. 2015
- Editorial. 33:1-1. 2015
- String shuffle: Circuits and graphs. 31:120-128. 2015
- Editorial. 23:1-1. 2013
- A computational framework for determining run-maximal strings. 20:43-50. 2013
- More results on overlapping squares. 17:2-8. 2012
- On a conjecture of Erdős for multiplicities of cliques. 17:9-14. 2012
- Editorial. 16:1-1. 2012
- Editorial. 14:1-1. 2012
- The three squares lemma revisited. 11:3-14. 2012
- On the structure of run-maximal strings. 10:10-14. 2012
- The longest common extension problem revisited and applications to approximate string searching. 8:418-428. 2010
- On the generalized Berge sorting conjecture. 8:1-7. 2010
- On the Ehrenfeucht–Mycielski sequence. 7:500-508. 2009
- Fast pattern-matching on indeterminate strings. 6:37-50. 2008
- A simple fast hybrid pattern-matching algorithm. 5:682-695. 2007
- Two-pattern strings II—frequency of occurrence and substring complexity. 5:739-748. 2007
- Two-pattern strings I—A recognition algorithm. 1:445-460. 2003