| No. |
Title |
Author |
Year |
| 1 |
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations |
Day, Joel D. et al. |
2019 |
| 2 |
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences |
Nowotka, Dirk et al. |
2018 |
| 3 |
Lagrange's Theorem for Binary Squares |
Madhusudan, P. et al. |
2018 |
| 4 |
Local Patterns |
Day, Joel D. et al. |
2018 |
| 5 |
Rollercoasters and Caterpillars |
Biedl, Therese et al. |
2018 |
| 6 |
The Hardness of Solving Simple Word Equations |
Day, Joel D. et al. |
2017 |
| 7 |
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111) |
Crochemore, Maxime et al. |
2014 |
| 8 |
Testing Generalised Freeness of Words |
Gawrychowski, Pawel et al. |
2014 |
| 9 |
Finding Pseudo-repetitions |
Gawrychowski, Pawel et al. |
2013 |
| 10 |
On the Pseudoperiodic Extension of u^l = v^m w^n |
Manea, Florin et al. |
2013 |
| 11 |
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) |
Crochemore, Maxime et al. |
2011 |
