Accepted Papers

  • Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus and Ely Porat. Hamming Distance Oracles
  • Rahul Varki, Travis Gagie and Christina Boucher. Efficient Grammar Compression via RLZ-based RePair
  • Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi and Shunsuke Inenaga. LZBE: an LZ-style compressor supporting O(log n)-time random access
  • Diptarka Chakraborty, Rudrayan Kundu, Nidhi Purohit and Aravinda Kanchana Ruwanpathirana. Maximizing Diversity in (near-)Median String Selection
  • Daniel Albert. Longest Common Extension of a Dynamic String in Parallel Constant Time
  • Ryosuke Yamano and Tetsuo Shibuya. Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
  • Shay Golan, Matan Kraus, Ely Porat and Braha Riva Shalom. Exploring the Gap Between LCS and LCStr
  • Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen and Wiktor Zuba. Improved Bounds on the Maximum Number of Distinct Squares in Circular Words
  • Paola Bonizzoni, Davide Cozzi and Younan Gao. Optimal-Time Mapping in Run-Length Compressed PBWT
  • Wojciech Janczewski and Tatiana Starikovskaya. Asymmetric Streaming Approximate Pattern Matching
  • Takuya Mieno. Compact representation of maximal palindromes
  • Itai Boneh, Estéban Gabory, Pawel Gawrychowski and Adam Górkiewicz. Balancing Two-Dimensional Straight-Line Programs
  • Soichiro Migita, Kyotaro Uehata and Tomohiro I. On the Smallest Size of Internal Collage Systems
  • Kotaro Kimura and Tomohiro I. R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
  • Rikuya Hamai, Hiroto Fujimaru and Shunsuke Inenaga. Constant multiplicative sensitivity on the CDAWGs
  • Simone Faro, Dominik Köppl, Thierry Lecroq and Francesco Pio Marino. A Bitwise Approach to SCER Matching in Indeterminate Strings
  • Arkadiusz Czarkowski. Improved Bounds on the Sum of Exponents of Runs in a String
  • Yuya Uezato. Matching Regular-Typed Pattern Languages: Quadratic-Time Algorithms
  • Jannik Olbrich and Enno Ohlebusch. The TAG array of a multiple sequence alignment
  • Travis Gagie. Merging RLBWTs adaptively
  • Michael Itzhaki, Amihood Amir, Ayelet Butman and Dina Sokol. On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Errors
  • Kaisei Kishi, Peaker Guo, Cristian Urbina and Hideo Bannai. On Occurrence-Preserving Morphisms
  • Pawel Gawrychowski, Florin Manea and Jonas Richardsen. Optimal Structure for Prefix-Substring Queries
  • Tomasz Kociumaka, Jakob Nogler and Philip Wellnitz. The Communication Complexity of Pattern Matching with Edits Revisited
  • Po-Chun Chen, Che-Wei Tsao, Wing-Kai Hon and Dominik Köppl. Efficient Index for Square Pattern Matching
  • Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno and Yoshio Okamoto. The Smallest String Attractors of Fibonacci and Period-Doubling Words
  • Johannes Fischer and Filippo Lari. Indexing and Encoding Arrays for Element Distinctness Queries
  • Gabriele Fici, Estéban Gabory, Giuseppe Romana and Marinella Sciortino. Totally Unclustered BWT Images of any Length over Non-Binary Alphabets
  • Dominik Köppl and Gregory Kucherov. Near-real-time Solutions for Online String Problems
  • Moshe Lewenstein and Ely Porat. Set Parameterized Matching via Multi-Layer Hashing
  • Jarno Alanko and Máximo Pérez López. Computing k-mers in Graphs
  • Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi and Cristian Urbina. Sensitivity of Repetitiveness Measures to String Reversal
  • Paola Bonizzoni, Younan Gao and Brian Riccardi. Constructing Suffixient Arrays Revisited
  • Dmitry Kosolobov. Compressed Index with Construction in Compressed Space
  • Carl Barton, Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Oded Lachish and Tatiana Starikovskaya. Periodicity Property Testing on Strings with Wildcards
  • Dominik Köppl and Jannik Olbrich. Hardness Results on Characteristics for Elastic-Degenerated Strings