| 2024 | 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024 Shunsuke Inenaga, Simon J. Puglisi |
| 2024 | A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem. Gianmarco Bertola, Anthony J. Cox, Veronica Guerrini, Giovanna Rosone |
| 2024 | A Data Structure for the Maximum-Sum Segment Problem with Offsets. Yoshifumi Sakai |
| 2024 | Algorithms for Galois Words: Detection, Factorization, and Rotation. Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | BAT-LZ out of hell. Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro |
| 2024 | Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. Meng He, Kaiyu Wu |
| 2024 | Computing the LCP Array of a Labeled Graph. Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza |
| 2024 | Connecting de Bruijn Graphs. Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2024 | Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. Dmitry Kosolobov, Nikita Sivukhin |
| 2024 | Efficient Construction of Long Orientable Sequences. Daniel Gabric, Joe Sawada |
| 2024 | Exploiting New Properties of String Net Frequency for Efficient Computation. Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel |
| 2024 | Faster Sliding Window String Indexing in Streams. Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow |
| 2024 | Finding Diverse Strings and Longest Common Subsequences in a Graph. Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Hairpin Completion Distance Lower Bound. Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus |
| 2024 | Internal Pattern Matching in Small Space and Applications. Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya |
| 2024 | Maintaining the Size of LZ77 on Semi-Dynamic Strings. Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski |
| 2024 | Minimizing the Minimizers via Alphabet Reordering. Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis |
| 2024 | Online Context-Free Recognition in OMv Time. Bartlomiej Dudek, Pawel Gawrychowski |
| 2024 | Random Wheeler Automata. Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza |
| 2024 | Reconstructing General Matching Graphs. Amihood Amir, Michael Itzhaki |
| 2024 | Searching 2D-Strings for Matching Frames. Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur |
| 2024 | Shortest Cover After Edit. Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2024 | Simplified Tight Bounds for Monotone Minimal Perfect Hashing. Dmitry Kosolobov |
| 2024 | Solving the Minimal Positional Substring Cover Problem in Sublinear Space. Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Yuri Pirola |
| 2024 | Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. Florin Manea, Jonas Richardsen, Markus L. Schmid |
| 2024 | The Rational Construction of a Wheeler DFA. Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi |
| 2024 | Tight Bounds for Compressing Substring Samples. Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz |
| 2024 | Walking on Words. Ian Pratt-Hartmann |
| 2024 | When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? Dana Fisman, Ilay Tzarfati |