Accepted Papers
Composite repetition-aware data structures
Range Minimum Query Indexes in Higher Dimensions
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
Encodings of Range Maximum-Sum Segment Queries and Applications
Sorting by cuts, joins and duplications
Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Lempel Ziv Computation In Small Space (LZ-CISS)
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
On Maximal Unbordered Factors
Online Detection of Repetitions with Backtracking
On the readability of overlap digraphs
Ranked Document Retrieval With Forbidden Pattern
Reporting Closest Substring Occurrences Under Bounded Gap Constraints
String Powers in Trees
Longest Common Extensions in Trees
A framework for space-efficient string kernels
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
Alphabet-Dependent String Searching with Wexponential Search Trees
Parameterized Complexity of Superstring Problems
Efficient construction of a compressed de Bruijn graph for pan-genome analysis
Longest Common Extensions in Sublinear Space
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
Parallel External Memory Suffix Sorting
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Compact Indexes for Flexible Top-k Retrieval
Tighter Bounds for the Sum of Irreducible LCP Values
Fast String Dictionary Lookup with One Error
Succinct Non-overlapping Indexing
Dictionary Matching With Uneven Gaps
Encoding Nearest Larger Values
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction problem
Greedy Conjecture for Strings of Length 4