Accepted papers
Optimal Rank and Select Queries on Dictionary-Compressed Text
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
Sufficient Conditions for Efficient Indexing under Different Matchings
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
Safe and complete algorithms for dynamic programming problems, with an application to RNA folding
Conversion from RLBWT to LZ77
Fully-functional bidirectional Burrows-Wheeler indexes
Entropy lower bounds for dictionary compression
A New Class of Searchable and Provably Highly Compressible String Transformations
Compressed Multiple Pattern Matching
Hamming distance completeness
Approximating Approximate Pattern Matching
Cartesian Tree Matching and Indexing
Indexing the Bijective BWT
On Maximal Repeats in Compressed Strings
Dichotomic selection on words: a probabilistic analysis
Computing the Antiperiod(s) of a String
Finding a Small Number of Colourful Components
Streaming dictionary matching with mismatches
Quasi-periodicity in streams
Computing runs on a trie
Linking BWT and XBW via Aho-Corasick automaton: applications to Run-Length Encoding
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Simulating the DNA string graph in succinct space
Faster queries for longest substring palindrome after block edit
A rearrangement distance for fully-labelled trees
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations
Online Algorithms for Constructing Linear-size Suffix Trie
Searching Long Repeats in Streams