| No. |
Title |
Author |
Year |
| 1 |
Front Matter, Table of Contents, Preface, Conference Organization |
Manea, Florin et al. |
2022 |
| 2 |
LIPIcs, Volume 216, CSL 2022, Complete Volume |
Manea, Florin et al. |
2022 |
| 3 |
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems |
Day, Joel D. et al. |
2022 |
| 4 |
Efficiently Testing Simon’s Congruence |
Gawrychowski, Paweł et al. |
2021 |
| 5 |
Matching Patterns with Variables Under Hamming Distance |
Gawrychowski, Paweł et al. |
2021 |
| 6 |
The Edit Distance to k-Subsequence Universality |
Day, Joel D. et al. |
2021 |
| 7 |
On the Structure of Solution Sets to Regular Word Equations |
Day, Joel D. et al. |
2020 |
| 8 |
Fast and Longest Rollercoasters |
Gawrychowski, Pawel et al. |
2019 |
| 9 |
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number |
Casel, Katrin et al. |
2019 |
| 10 |
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations |
Day, Joel D. et al. |
2019 |
| 11 |
Local Patterns |
Day, Joel D. et al. |
2018 |
| 12 |
Rollercoasters and Caterpillars |
Biedl, Therese et al. |
2018 |
| 13 |
The Hardness of Solving Simple Word Equations |
Day, Joel D. et al. |
2017 |
| 14 |
Efficiently Finding All Maximal alpha-gapped Repeats |
Gawrychowski, Pawel et al. |
2016 |
| 15 |
Factorizing a String into Squares in Linear Time |
Matsuoka, Yoshiaki et al. |
2016 |
| 16 |
Pattern Matching with Variables: Fast Algorithms and New Hardness Results |
Fernau, Henning et al. |
2015 |
| 17 |
Testing Generalised Freeness of Words |
Gawrychowski, Pawel et al. |
2014 |
| 18 |
Finding Pseudo-repetitions |
Gawrychowski, Pawel et al. |
2013 |
| 19 |
On the Pseudoperiodic Extension of u^l = v^m w^n |
Manea, Florin et al. |
2013 |
