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