CPM 2018: Qingdao, China

• Gonzalo Navarro, David Sankoff, Binhai Zhu:
  Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
   download paper
• Yoshifumi Sakai:
  Maximal Common Subsequence Algorithms. 1:1-1:10
   download paper
• Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai:
  Order-Preserving Pattern Matching Indeterminate Strings. 2:1-2:15
   download paper
• Uwe Baier:
  On Undetected Redundancy in the Burrows-Wheeler Transform. 3:1-3:15
   download paper
• Amihood Amir, Avivit Levy, Ely Porat:
  Quasi-Periodicity Under Mismatch Errors. 4:1-4:15
   download paper
• Brian Brubach:
  Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant. 5:1-5:14
   download paper
• Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme:
  Nearest constrained circular words. 6:1-6:14
   download paper
• Hideo Bannai, Travis Gagie, Tomohiro I:
  Online LZ77 Parsing and Matching Statistics with RLBWTs. 7:1-7:12
   download paper
• Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
  Non-Overlapping Indexing - Cache Obliviously. 8:1-8:9
   download paper
• Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Faster Online Elastic Degenerate String Matching. 9:1-9:10
   download paper
• Tatsuya Akutsu, Colin de la Higuera, Takeyuki Tamura:
  A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. 10:1-10:12
   download paper
• Amihood Amir, Itai Boneh:
  Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. 11:1-11:13
   download paper
• Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Longest substring palindrome after edit. 12:1-12:14
   download paper
• Brian Brubach, Jay Ghurye:
  A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment. 13:1-13:12
   download paper
• Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng:
  Can a permutation be sorted by best short swaps? 14:1-14:12
   download paper
• Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
  Computing longest common square subsequences. 15:1-15:13
   download paper
• Bartlomiej Dudek, Pawel Gawrychowski:
  Slowing Down Top Trees for Better Worst-Case Compression. 16:1-16:8
   download paper
• Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
  On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. 17:1-17:15
   download paper
• Rayan Chikhi, Alexander Schönhuth:
  Dualities in Tree Representations. 18:1-18:12
   download paper
• Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Longest Lyndon Substring After Edit. 19:1-19:10
   download paper
• Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
  The Heaviest Induced Ancestors Problem Revisited. 20:1-20:13
   download paper
• Bastien Cazaux, Eric Rivals:
  Superstrings with multiplicities. 21:1-21:16
   download paper
• Kilho Shin, Taichi Ishikawa:
  Linear-time algorithms for the subpath kernel. 22:1-22:13
   download paper
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
  Linear-Time Algorithm for Long LCF with k Mismatches. 23:1-23:16
   download paper
• Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Lyndon Factorization of Grammar Compressed Texts Revisited. 24:1-24:10
   download paper