| No. | Title | Author | Year |  
| 1 | Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications | Gabory, Esteban et al. | 2023 | 
| 2 | Suffix-Prefix Queries on a Dictionary | Loukides, Grigorios et al. | 2023 | 
| 3 | Approximate Circular Pattern Matching | Charalampopoulos, Panagiotis et al. | 2022 | 
| 4 | Longest Palindromic Substring in Sublinear Time | Charalampopoulos, Panagiotis et al. | 2022 | 
| 5 | Making de Bruijn Graphs Eulerian | Bernardini, Giulia et al. | 2022 | 
| 6 | On Strings Having the Same Length- k Substrings | Bernardini, Giulia et al. | 2022 | 
| 7 | Bidirectional String Anchors: A New String Sampling Mechanism | Loukides, Grigorios et al. | 2021 | 
| 8 | Constructing Strings Avoiding Forbidden Substrings | Bernardini, Giulia et al. | 2021 | 
| 9 | Faster Algorithms for Longest Common Substring | Charalampopoulos, Panagiotis et al. | 2021 | 
| 10 | Internal Shortest Absent Word Queries | Badkobeh, Golnaz et al. | 2021 | 
| 11 | Pattern Masking for Dictionary Matching | Charalampopoulos, Panagiotis et al. | 2021 | 
| 12 | String Sanitization Under Edit Distance: Improved and Generalized | Mieno, Takuya et al. | 2021 | 
| 13 | String Sanitization Under Edit Distance | Bernardini, Giulia et al. | 2020 | 
| 14 | Unary Words Have the Smallest Levenshtein k-Neighbourhoods | Charalampopoulos, Panagiotis et al. | 2020 | 
| 15 | Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication | Bernardini, Giulia et al. | 2019 | 
| 16 | LIPIcs, Volume 128, CPM'19, Complete Volume | Pisanti, Nadia et al. | 2019 | 
| 17 | Longest Common Substring Made Fully Dynamic | Amir, Amihood et al. | 2019 | 
| 18 | Degenerate String Comparison and Applications | Alzamel, Mai et al. | 2018 | 
| 19 | Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line | Pissis, Solon P. et al. | 2018 | 
| 20 | Linear-Time Algorithm for Long LCF with k Mismatches | Charalampopoulos, Panagiotis et al. | 2018 | 
| 21 | Longest Unbordered Factor in Quasilinear Time | Kociumaka, Tomasz et al. | 2018 | 
| 22 | Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers | Iliopoulos, Costas S. et al. | 2017 | 
| 23 | LIPIcs, Volume 75, SEA'17, Complete Volume | Iliopoulos, Costas S. et al. | 2017 | 
| 24 | On-Line Pattern Matching on Similar Texts | Grossi, Roberto et al. | 2017 | 
| 25 | Optimal Computation of Overabundant Words | Almirantis, Yannis et al. | 2017 | 
| 26 | Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time | Crochemore, Maxime et al. | 2017 | 
| 27 | Efficient Index for Weighted Sequences | Barton, Carl et al. | 2016 | 
| 28 | Pattern Matching and Consensus Problems on Weighted Sequences and Profiles | Kociumaka, Tomasz et al. | 2016 |