LIPIcs, Volume 191, CPM 2021

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