Alan Cleary, Joseph Winjum, Jordan Dood and Shunsuke Inenaga. Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
Amihood Amir, Eitan Kondratovsky, Shoshana Marcus and Dina Sokol. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets
Hiroki Shibata and Dominik Köppl. LZ78 Substring Compression with CDAWGs
Wataru Sumiyoshi, Takuya Mieno and Shunsuke Inenaga. Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
Gonzalo Navarro. Adaptive Dynamic Bitvectors
Davide Cenzato, Francisco Olivares and Nicola Prezza. On Computing the Smallest Suffixient Set
Ruben Becker, Sung-Hwan Kim, Nicola Prezza and Carlo Tosoni. Indexing Finite-State Automata Using Forward-Stable Partitions
Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino and Cristian Urbina. Generalization of Repetitiveness Measures for Two-Dimensional Strings
Jakub Radoszewski and Wiktor Zuba. Computing String Covers in Sublinear Time
Mathieu Gascon, Mattéo Delabre and Nadia El-Mabrouk. Simultaneously Building and Reconciling a Synteny Tree
Daniel Gibney and Md Helal Hossen. Quantum Algorithms for Longest Common Substring with a Gap
Anouk Duyster and Tomasz Kociumaka. Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
Masaru Kikuchi and Shunsuke Inenaga. All-Pairs Suffix-Prefix on Dynamic Set of Strings
Akito Takasaka and Tomohiro I. Space-efficient SLP Encoding for $O(\log N)$-time Random Access
Maksim Nikolaev. Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. On the Number of Non-equivalent Parameterized Squares in a String
Peaker Guo, Seeun William Umboh, Anthony Wirth and Justin Zobel. Online Computation of String Net Frequency
Itai Boneh, Shay Golan, Avivit Levy, Ely Porat and B. Riva Shalom. Burst Edit Distance
Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń. Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words
Yuki Yonemoto and Shunsuke Inenaga. Simple linear-time repetition factorization
Dina Sokol, Shoshana Marcus and Sarah Zelikovitz. 2d Side-Sharing Tandems with Mismatches
Gonzalo Navarro and Josefa Robert. Compressed Graph Representations for Evaluating Regular Path Queries
Short Papers
Enno Ohlebusch, Thomas Büchler and Jannik Olbrich. Faster computation of Chinese frequent strings and their net frequencies
Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li and Norbert Zeh. Another virtue of wavelet forests
Golnaz Badkobeh, Hideo Bannai and Dominik Köppl. Bijective BWT based Compression Schemes
Arnab Ganguly, Daniel Gibney, Paul MacNichol and Sharma V. Thankachan. Bounded-Ratio Gapped String Indexing
