| 2022 | 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Czech Republic, June 27-29, 2022 Hideo Bannai, Jan Holub |
| 2022 | A Theoretical and Experimental Analysis of BWT Variants for String Collections. Davide Cenzato, Zsuzsanna Lipták |
| 2022 | An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau |
| 2022 | Arbitrary-Length Analogs to de Bruijn Sequences. Abhinav Nellore, Rachel A. Ward |
| 2022 | Back-To-Front Online Lyndon Forest Construction. Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud |
| 2022 | Beyond the Longest Letter-Duplicated Subsequence Problem. Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou |
| 2022 | Bi-Directional r-Indexes. Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane |
| 2022 | Cartesian Tree Subsequence Matching. Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura |
| 2022 | Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk). Sharma V. Thankachan |
| 2022 | Efficient Construction of the BWT for Repetitive Text Using String Compression. Diego Díaz-Domínguez, Gonzalo Navarro |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2022 | Indexable Elastic Founder Graphs of Minimum Height. Nicola Rizzo, Veli Mäkinen |
| 2022 | Invitation to Combinatorial Reconfiguration (Invited Talk). Takehiro Ito |
| 2022 | Linear-Time Computation of Shortest Covers of All Rotations of a String. Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | Longest Palindromic Substring in Sublinear Time. Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski |
| 2022 | Making de Bruijn Graphs Eulerian. Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2022 | Mechanical Proving with Walnut for Squares and Cubes in Partial Words. John M. Machacek |
| 2022 | Minimal Absent Words on Run-Length Encoded Strings. Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2022 | On Strings Having the Same Length- k Substrings. Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering |
| 2022 | Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2022 | Partial Permutations Comparison, Maintenance and Applications. Avivit Levy, Ely Porat, B. Riva Shalom |
| 2022 | Permutation Pattern Matching for Doubly Partially Ordered Patterns. Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette |
| 2022 | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2022 | Rectangular Tile Covers of 2D-Strings. Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | Reduction Ratio of the IS-Algorithm: Worst and Random Cases. Vincent Jugé |
| 2022 | Reordering a Tree According to an Order on Its Leaves. Laurent Bulteau, Philippe Gambette, Olga Seminck |
| 2022 | The Dynamic k-Mismatch Problem. Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski |
| 2022 | The Fine-Grained Complexity of Episode Matching. Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann |
| 2022 | The Normalized Edit Distance with Uniform Operation Costs Is a Metric. Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss |
| 2022 | Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). Jeffrey O. Shallit |
| 2022 | {RePair} Grammars Are the Smallest Grammars for Fibonacci Words. Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama |