| 2023 | 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vallée, France, June 26-28, 2023 Laurent Bulteau, Zsuzsanna Lipták |
| 2023 | Approximation Algorithms for the Longest Run Subsequence Problem. Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka |
| 2023 | Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba |
| 2023 | Compressed Indexing for Consecutive Occurrences. Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner |
| 2023 | Computing MEMs on Repetitive Text Collections. Gonzalo Navarro |
| 2023 | Encoding Hard String Problems with Answer Set Programming. Dominik Köppl |
| 2023 | Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa |
| 2023 | Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. Sung-Hwan Kim, Francisco Olivares, Nicola Prezza |
| 2023 | From Bit-Parallelism to Quantum String Matching for Labelled Graphs. Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Improving the Sensitivity of MinHash Through Hash-Value Analysis. Gregory Kucherov, Steven Skiena |
| 2023 | L-Systems for Measuring Repetitiveness. Gonzalo Navarro, Cristian Urbina |
| 2023 | Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2023 | MONI Can Find k-MEMs. Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie |
| 2023 | MUL-Tree Pruning for Consistency and Compatibility. Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung |
| 2023 | Merging Sorted Lists of Similar Strings. Gene Myers |
| 2023 | On Distances Between Words with Parameters. Pierre Bourhis, Aaron Boussidan, Philippe Gambette |
| 2023 | On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag |
| 2023 | On the Impact of Morphisms on BWT-Runs. Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
| 2023 | Optimal LZ-End Parsing Is Hard. Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | Optimal Near-Linear Space Heaviest Induced Ancestors. Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski |
| 2023 | Order-Preserving Squares in Strings. Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau |
| 2023 | PalFM-Index: FM-Index for Palindrome Pattern Matching. Shinya Nagashita, Tomohiro I |
| 2023 | Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. Manuel Cáceres |
| 2023 | Sliding Window String Indexing in Streams. Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen |
| 2023 | String Factorization via Prefix Free Families. Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia |
| 2023 | Suffix-Prefix Queries on a Dictionary. Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba |
| 2023 | Trie-Compressed Adaptive Set Intersection. Diego Arroyuelo, Juan Pablo Castillo |