


default search action
37th CPM 2026: Copenhagen, Denmark
- Philip Bille

, Nicola Prezza
:
37th Annual Symposium on Combinatorial Pattern Matching, CPM 2026, Copenhagen, Denmark, June 15-17, 2026. LIPIcs 369, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-420-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii

- Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Ely Porat:

Hamming Distance Oracles. 1:1-1:12 - Dominik Köppl, Gregory Kucherov:

Near-Real-Time Solutions for Online String Problems. 2:1-2:17 - Jarno N. Alanko, Máximo Pérez López:

Computing k-mers in Graphs. 3:1-3:17 - Takuya Mieno:

Compact Representation of Maximal Palindromes. 4:1-4:12 - Rahul Varki, Travis Gagie, Christina Boucher:

Efficient Grammar Compression via RLZ-Based RePair. 5:1-5:15 - Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:

Improved Bounds on the Maximum Number of Distinct Squares in Circular Words. 6:1-6:12 - Pawel Gawrychowski, Florin Manea, Jonas Richardsen:

Optimal Structure for Prefix-Substring Queries. 7:1-7:20 - Rikuya Hamai, Hiroto Fujimaru, Shunsuke Inenaga:

Constant Multiplicative Sensitivity on the CDAWGs. 8:1-8:17 - Johannes Fischer, Filippo Lari:

Indexing and Encoding Arrays for Element Distinctness Queries. 9:1-9:17 - Kotaro Kimura, Tomohiro I:

R-Enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies. 10:1-10:14 - Yuya Uezato:

Matching Regular-Typed Pattern Languages: Quadratic-Time Algorithms. 11:1-11:20 - Diptarka Chakraborty, Rudrayan Kundu, Nidhi Purohit, Aravinda Kanchana Ruwanpathirana:

Maximizing Diversity in (Near-)Median String Selection. 12:1-12:15 - Gabriele Fici, Estéban Gabory, Giuseppe Romana, Marinella Sciortino:

Totally Unclustered BWT Images of Any Length over Non-Binary Alphabets. 13:1-13:17 - Dominik Köppl, Jannik Olbrich:

Hardness Results on Characteristics for Elastic-Degenerate Strings. 14:1-14:25 - Ryosuke Yamano, Tetsuo Shibuya:

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements. 15:1-15:11 - Travis Gagie:

Merging RLBWTs Adaptively. 16:1-16:15 - Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina:

Sensitivity of Repetitiveness Measures to String Reversal. 17:1-17:18 - Amihood Amir, Ayelet Butman, Michael Itzhaki, Dina Sokol:

On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and k-Mismatches. 18:1-18:18 - Wojciech Janczewski, Tatiana Starikovskaya:

Asymmetric Streaming Approximate Pattern Matching. 19:1-19:15 - Daniel Alexander Albert:

Longest Common Extension of a Dynamic String in Parallel Constant Time. 20:1-20:21 - Simone Faro, Dominik Köppl, Thierry Lecroq, Francesco Pio Marino:

A Bitwise Approach to SCER Matching in Indeterminate Strings. 21:1-21:17 - Paola Bonizzoni, Davide Cozzi, Younan Gao:

Optimal-Time Mapping in Run-Length Compressed PBWT. 22:1-22:18 - Arkadiusz Czarkowski:

Improved Bounds on the Sum of Exponents of Runs in a String. 23:1-23:18 - Kaisei Kishi, Peaker Guo, Cristian Urbina, Hideo Bannai:

On Occurrence-Preserving Morphisms. 24:1-24:16 - Dmitry Kosolobov:

Compressed Index with Construction in Compressed Space. 25:1-25:24 - Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:

The Communication Complexity of Pattern Matching with Edits Revisited. 26:1-26:15 - Shay Golan, Matan Kraus, Ely Porat, B. Riva Shalom:

Exploring the Gap Between LCS and LCStr. 27:1-27:21 - Carl Barton, Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Oded Lachish, Tatiana Starikovskaya:

Periodicity Property Testing on Strings with Wildcards. 28:1-28:18 - Jannik Olbrich, Enno Ohlebusch:

The TAG Array of a Multiple Sequence Alignment. 29:1-29:14 - Paola Bonizzoni, Younan Gao, Brian Riccardi:

Constructing Suffixient Arrays Revisited. 30:1-30:18 - Soichiro Migita, Kyotaro Uehata, Tomohiro I:

On the Smallest Size of Internal Collage Systems. 31:1-31:14 - Itai Boneh, Estéban Gabory, Pawel Gawrychowski, Adam Górkiewicz:

Balancing Two-Dimensional Straight-Line Programs. 32:1-32:20 - Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno, Yoshio Okamoto:

The Smallest String Attractors of Fibonacci and Period-Doubling Words. 33:1-33:21 - Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga:

LZBE: An LZ-Style Compressor Supporting O(log n)-Time Random Access. 34:1-34:18 - Po-Chun Chen, Che-Wei Tsao, Wing-Kai Hon, Dominik Köppl:

Efficient Index for Square Pattern Matching. 35:1-35:12 - Moshe Lewenstein, Ely Porat:

Set Parameterized Matching via Multi-Layer Hashing. 36:1-36: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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














