| Publication | Date of Publication | Type |
|---|
| Sweep complexity revisited | 2024-02-28 | Paper |
| Clusters of repetition roots forming prefix chains | 2023-01-18 | Paper |
| Pattern Matching with Variables | 2022-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867520 | 2022-09-14 | Paper |
| A toolkit for Parikh matrices | 2022-08-16 | Paper |
| Clusters of repetition roots: single chains | 2022-03-24 | Paper |
| Reducing the ambiguity of Parikh matrices | 2021-03-09 | Paper |
| Reducing the ambiguity of Parikh matrices | 2020-07-27 | Paper |
| On the Prefix–Suffix Duplication Reduction | 2020-02-21 | Paper |
| Hide and seek with repetitions | 2019-01-25 | Paper |
| Alignment-free sequence comparison using absent words | 2018-09-27 | Paper |
| Revisiting Shinohara's algorithm for computing descriptive patterns | 2018-06-05 | Paper |
| Corrigendum to ``A note on Thue games | 2017-11-22 | Paper |
| Circular Sequence Comparison with q-grams | 2017-07-25 | Paper |
| On the aperiodic avoidability of binary patterns with variables and reversals | 2017-06-15 | Paper |
| On the density of Lyndon roots in factors | 2017-02-06 | Paper |
| Finding Pseudo-Repetitions | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955004 | 2017-01-24 | Paper |
| Counting maximal-exponent factors in words | 2016-12-19 | Paper |
| A note on Thue games | 2016-11-23 | Paper |
| Regular languages of partial words | 2016-07-08 | Paper |
| Linear-Time Sequence Comparison Using Minimal Absent Words & Applications | 2016-05-03 | Paper |
| \(k\)-abelian pattern matching | 2015-08-24 | Paper |
| INNER PALINDROMIC CLOSURE | 2015-04-23 | Paper |
| 5-Abelian cubes are avoidable on binary alphabets | 2014-12-12 | Paper |
| Binary patterns in binary cube-free words: Avoidability and growth | 2014-12-12 | Paper |
| An algorithmic toolbox for periodic partial words | 2014-12-03 | Paper |
| The pseudopalindromic completion of regular languages | 2014-11-28 | Paper |
| k-Abelian Pattern Matching | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414548 | 2014-05-06 | Paper |
| A note on the decidability of subword inequalities | 2013-10-23 | Paper |
| The Lexicographic Cross-Section of the Plactic Monoid Is Regular | 2013-09-20 | Paper |
| 3-Abelian Cubes Are Avoidable on Binary Alphabets | 2013-06-28 | Paper |
| Inner Palindromic Closure | 2013-06-28 | Paper |
| Hairpin Completion with Bounded Stem-Loop | 2012-11-02 | Paper |
| Hairpin Lengthening and Shortening of Regular Languages | 2012-11-01 | Paper |
| Fine and Wilf’s Theorem and Pseudo-repetitions | 2012-09-25 | Paper |
| Connecting Partial Words and Regular Languages | 2012-08-14 | Paper |
| Periodicity algorithms and a conjecture on overlaps in partial words | 2012-08-10 | Paper |
| The three-squares lemma for partial words with one hole | 2012-05-30 | Paper |
| Avoidable binary patterns in partial words | 2012-03-23 | Paper |
| Erratum to: ``Avoidable binary patterns in partial words | 2012-03-23 | Paper |
| Avoiding Abelian squares in partial words | 2011-11-11 | Paper |
| Periodicity Algorithms for Partial Words | 2011-08-17 | Paper |
| Counting bordered partial words by critical positions | 2011-07-15 | Paper |
| Avoiding large squares in partial words | 2011-07-14 | Paper |
| Abelian Square-Free Partial Words | 2010-05-26 | Paper |
| Avoidable Binary Patterns in Partial Words | 2010-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5306171 | 2010-04-08 | Paper |
| A note on the number of squares in a partial word with one hole | 2009-12-18 | Paper |
| Unbordered partial words | 2009-06-30 | Paper |
| An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms | 2009-04-02 | Paper |
| How Many Holes Can an Unbordered Partial Word Contain? | 2009-04-02 | Paper |
| A generalization of Thue freeness for partial words | 2009-03-17 | Paper |
| Freeness of partial words | 2008-01-07 | Paper |
