- Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets.- Bijective BWT based Compression Schemes.- Indexing Finite-State Automata Using Forward-Stable Partitions.- Burst Edit Distance.- Generalization of Repetitiveness Measures for Two-Dimensional Strings.- On Computing the Smallest Suffixient Set.- Revisiting the Folklore Algorithm for Random Access to Grammar- Compressed Strings.- Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts.

- Bounded-Ratio Gapped String Indexing.- Simultaneously Building and Reconciling a Synteny Tree.- Quantum Algorithms for Longest Common Substring with a Gap.- Online Computation of String Net Frequency.- On the Number of Non-equivalent Parameterized Squares in a String.- Another virtue of wavelet forests.- All-Pairs Suffix-Prefix on Dynamic Set of Strings.- Adaptive Dynamic Bitvectors.

- Compressed Graph Representations for Evaluating Regular Path Queries.- Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings.- Faster computation of Chinese frequent strings and their net frequencies.- Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.- Computing String Covers in Sublinear Time.- LZ78 Substring Compression with CDAWGs.- 2d Side-Sharing Tandems with Mismatches.- Faster and simpler online/sliding rightmost Lempel-Ziv factorizations.

- Space-efficient SLP Encoding for O(log N)-time Random Access.- Simple Linear-time Repetition Factorization.