LIPIcs, Volume 223, CPM 2022

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