Accepted papers
Can We Recover the Cover?
Approximate Cover of Strings
Computing All Distinct Squares in Linear Time for Integer Alphabets
Representing the suffix tree with the CDAWG
Lempel-Ziv Compression in a Sliding Window
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
Deterministic Indexing for Packed Strings
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
Beyond Adjacency Maximization: Scaffold Filling for New String Distances
Optimal Omnitig Listing for Safe and Complete Contig Assembly
The Longest Filled Common Subsequence Problem
Faster Jumbled Indexing for Binary RLE Strings
Position Heaps for Parameterized Strings
Gapped Pattern Statistics
A family of approximation algorithms for the maximum duo-preservation string mapping problem
Path Queries on Functions
On-line pattern matching on similar texts
Longest Common Extensions with Recompression
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping
Palindromic Length in Linear Time
Faster STR-IC-LCS computation via RLE
On the Weighted Quartet Consensus problem
Tight bounds on the maximum number of shortest unique substrings
Document Listing on Repetitive Collections with Guaranteed Performance
Synergistic Solutions on MultiSets
Dynamic Elias-Fano Representation
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
Communication and streaming complexity of approximate pattern matching