default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd CPM 2022: Prague, Czech Republic
- Hideo Bannai
, Jan Holub:
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Czech Republic, June 27-29, 2022. LIPIcs 223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-234-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Takehiro Ito:
Invitation to Combinatorial Reconfiguration (Invited Talk). 1:1-1:1 - Jeffrey O. Shallit:
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). 2:1-2:3 - Sharma V. Thankachan:
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk). 3:1-3:3 - Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. 4:1-4:12 - John M. Machacek:
Mechanical Proving with Walnut for Squares and Cubes in Partial Words. 5:1-5:11 - Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau:
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. 6:1-6:11 - Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
Beyond the Longest Letter-Duplicated Subsequence Problem. 7:1-7:12 - Vincent Jugé:
Reduction Ratio of the IS-Algorithm: Worst and Random Cases. 8:1-8:23 - Abhinav Nellore, Rachel A. Ward:
Arbitrary-Length Analogs to de Bruijn Sequences. 9:1-9:20 - Avivit Levy, Ely Porat, B. Riva Shalom:
Partial Permutations Comparison, Maintenance and Applications. 10:1-10:17 - Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane:
Bi-Directional r-Indexes. 11:1-11:14 - Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Making de Bruijn Graphs Eulerian. 12:1-12:18 - Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. 13:1-13:23 - Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. 14:1-14:18 - Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. 15:1-15:17 - Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length- k Substrings. 16:1-16:17 - Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. 17:1-17:17 - Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. 18:1-18:15 - Nicola Rizzo, Veli Mäkinen:
Indexable Elastic Founder Graphs of Minimum Height. 19:1-19:19 - Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Palindromic Substring in Sublinear Time. 20:1-20:9 - Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. 21:1-21:17 - Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Shortest Covers of All Rotations of a String. 22:1-22:15 - Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Rectangular Tile Covers of 2D-Strings. 23:1-23:14 - Laurent Bulteau, Philippe Gambette, Olga Seminck:
Reordering a Tree According to an Order on Its Leaves. 24:1-24:15 - Davide Cenzato, Zsuzsanna Lipták:
A Theoretical and Experimental Analysis of BWT Variants for String Collections. 25:1-25:18 - Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. 26:1-26:17 - Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. 27:1-27:17 - Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. 28:1-28:21 - Diego Díaz-Domínguez, Gonzalo Navarro:
Efficient Construction of the BWT for Repetitive Text Using String Compression. 29:1-29:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-19 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
