| 2021 | 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wrocław, Poland, July 5-7, 2021 Pawel Gawrychowski, Tatiana Starikovskaya |
| 2021 | A Compact Index for Cartesian Tree Matching. Sung-Hwan Kim, Hwan-Gue Cho |
| 2021 | A Fast and Small Subsampled R-Index. Dustin Cobas, Travis Gagie, Gonzalo Navarro |
| 2021 | A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals |
| 2021 | AWLCO: All-Window Length Co-Occurrence. Joshua Sobel, Noah Bertram, Chen Ding, Fatemeh Nargesian, Daniel Gildea |
| 2021 | An Invertible Transform for Efficient String Matching in Labeled Digraphs. Abhinav Nellore, Austin Nguyen, Reid F. Thompson |
| 2021 | Compressed Weighted de Bruijn Graphs. Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini |
| 2021 | Computing Covers of 2D-Strings. Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | Computing Edit Distance (Invited Talk). Michal Koucký |
| 2021 | Constructing Strings Avoiding Forbidden Substrings. Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2021 | Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski |
| 2021 | Data Structures for Categorical Path Counting Queries. Meng He, Serikzhan Kazi |
| 2021 | Disorders and Permutations. Laurent Bulteau, Samuele Giraudo, Stéphane Vialette |
| 2021 | Efficient Algorithms for Counting Gapped Palindromes. Andrei Popa, Alexandru Popa |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Gapped Indexing for Consecutive Occurrences. Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner |
| 2021 | Internal Shortest Absent Word Queries. Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis |
| 2021 | On-Line Pattern Matching on D-Texts (Invited Talk). Nadia Pisanti |
| 2021 | Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance. Keegan Yao, Mukul S. Bansal |
| 2021 | Optimal Construction of Hierarchical Overlap Graphs. Shahbaz Khan |
| 2021 | R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space. Takaaki Nishimoto, Yasuo Tabei |
| 2021 | Ranking Bracelets in Polynomial Time. Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas |
| 2021 | Repetitions in Strings: A "Constant" Problem (Invited Talk). Hideo Bannai |
| 2021 | String Sanitization Under Edit Distance: Improved and Generalized. Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2021 | The Longest Run Subsequence Problem: Further Complexity Results. Riccardo Dondi, Florian Sikora |
| 2021 | The k-Mappability Problem Revisited. Amihood Amir, Itai Boneh, Eitan Kondratovsky |
| 2021 | Weighted Ancestors in Suffix Trees Revisited. Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman |