| No. |
Title |
Author |
Year |
| 1 |
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints |
Kleest-Meißner, Sarah et al. |
2022 |
| 2 |
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems |
Day, Joel D. et al. |
2022 |
| 3 |
A Purely Regular Approach to Non-Regular Core Spanners |
Schmid, Markus L. et al. |
2021 |
| 4 |
Fine-Grained Complexity of Regular Path Queries |
Casel, Katrin et al. |
2021 |
| 5 |
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number |
Casel, Katrin et al. |
2019 |
| 6 |
Consensus Strings with Small Maximum Distance and Small Distance Sum |
Bulteau, Laurent et al. |
2018 |
| 7 |
Combinatorial Properties and Recognition of Unit Square Visibility Graphs |
Casel, Katrin et al. |
2017 |
| 8 |
Deterministic Regular Expressions with Back-References |
Freydenberger, Dominik D. et al. |
2017 |
| 9 |
On the Complexity of Grammar-Based Compression over Fixed Alphabets |
Casel, Katrin et al. |
2016 |
| 10 |
Pattern Matching with Variables: Fast Algorithms and New Hardness Results |
Fernau, Henning et al. |
2015 |
| 11 |
On the Parameterised Complexity of String Morphism Problems |
Fernau, Henning et al. |
2013 |
