| 2026 | Improved Bounds on the Maximum Number of Distinct Squares in Circular Words. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2026 | Maximizing Diversity in (Near-)Median String Selection. | Diptarka Chakraborty, Rudrayan Kundu, Nidhi Purohit, Aravinda Kanchana Ruwanpathirana |
| 2026 | Constructing Suffixient Arrays Revisited. | Paola Bonizzoni, Younan Gao, Brian Riccardi |
| 2026 | Optimal-Time Mapping in Run-Length Compressed PBWT. | Paola Bonizzoni, Davide Cozzi, Younan Gao |
| 2026 | Balancing Two-Dimensional Straight-Line Programs. | Itai Boneh, Estban Gabory, Pawel Gawrychowski, Adam Grkiewicz |
| 2026 | Hamming Distance Oracles. | Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Ely Porat |
| 2026 | Periodicity Property Testing on Strings with Wildcards. | Carl Barton, Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Oded Lachish, Tatiana Starikovskaya |
| 2026 | Sensitivity of Repetitiveness Measures to String Reversal. | Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina |
| 2026 | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and k-Mismatches. | Amihood Amir, Ayelet Butman, Michael Itzhaki, Dina Sokol |
| 2026 | Longest Common Extension of a Dynamic String in Parallel Constant Time. | Daniel Alexander Albert |
| 2026 | Computing k-mers in Graphs. | Jarno N. Alanko, Mximo Prez Lpez |
| 2025 | Shortest Undirected Paths in de Bruijn Graphs. | Wiktor Zuba, Oded Lachish, Solon P. Pissis |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | Linear-Space LCS Enumeration for Two Strings. | Yoshifumi Sakai |
| 2025 | Faster Approximate Elastic-Degenerate String Matching - Part A. | Solon P. Pissis, Jakub Radoszewski, Wiktor Zuba |
| 2025 | Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It. | Eric M. Osterkamp, Dominik Kppl |
| 2025 | The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable. | Dirk Nowotka, Max Wiedenhft |
| 2025 | Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. | Cyril Nicaud, Carine Pivoteau, Stphane Vialette |
| 2025 | Space-Efficient Online Computation of String Net Occurrences. | Takuya Mieno, Shunsuke Inenaga |
| 2025 | Generating a Cyclic 2-Gray Code for Lucas Words in Constant Amortized Time. | Bowie Liu, Dennis Wong, Chan-Tong Lam, Sio Kei Im |
| 2025 | Encodings for Range Minimum Queries over Bounded Alphabets. | Seungbum Jo, Srinivasa Rao Satti |
| 2025 | Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time. | Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | Net Occurrences in Fibonacci and Thue-Morse Words. | Peaker Guo, Kaisei Kishi |
| 2025 | Faster Approximate Elastic-Degenerate String Matching - Part B. | Pawel Gawrychowski, Adam Grkiewicz, Pola Marciniak, Solon P. Pissis, Karol Pokorski |