Accepted papers
These papers were accepted to CPM 2024 conference:
- Gianmarco Bertola, Anthony J. Cox, Veronica Guerrini and Giovanna Rosone: A class of heuristics for reducing the number of BWT-runs in the String Ordering Problem
- Yoshifumi Sakai: A data structure for the maximum-sum segment problem with offsets
- Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka and Ayumi Shinohara: Algorithms for Galois Words: Detection, Factorization, and Rotation
- Zsuzsanna Liptak, Francesco Masillo and Gonzalo Navarro: BAT-LZ out of Hell
- Jarno Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini and Nicola Prezza: Computing the LCP Array of a Labeled Graph
- Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon Pissis, Leen Stougie and Michelle Sweering: Connecting de Bruijn Graphs
- Dmitry Kosolobov and Nikita Sivukhin: Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
- Daniel Gabric and Joe Sawada: Efficient construction of long orientable sequences
- Peaker Guo, Patrick Eades, Anthony Wirth and Justin Zobel: Exploiting New Properties of String Net Frequency for Efficient Computation
- Philip Bille, Pawel Gawrychowski, Inge Li Gørtz and Simon R. Tarnow: Faster Sliding Window String Indexing in Streams
- Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno and Hiroki Arimura: Finding Diverse Strings and Longest Common Subsequences in a Graph
- Itai Boneh, Dvir Fried, Shay Golan and Matan Kraus: Hairpin Completion Distance Lower Bound
- Gabriel Bathie, Panagiotis Charalampopoulos and Tatiana Starikovskaya: Internal Pattern Matching in Small Space and Applications
- Hideo Bannai, Panagiotis Charalampopoulos and Jakub Radoszewski: Maintaining the Size of LZ77 on Semi-dynamic Strings
- Hilde Verbeek, Lorraine Ayad, Grigorios Loukides and Solon Pissis: Minimizing the Minimizers via Alphabet Reordering
- Bartlomiej Dudek and Pawel Gawrychowski: Online Context-Free Recognition in OMv Time
- Meng He and Kaiyu Wu: Optimal Distance Labeling Scheme for Interval Graphs
- Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso and Nicola Prezza: Random Wheeler Automata
- Michael Itzhaki and Amihood Amir: Reconstructing General Matching Graphs
- Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus and Arseny Shur: Searching 2D-Strings for Matching Frames
- Kazuki Mitani, Takuya Mieno, Kazuhisa Seto and Takashi Horiyama: Shortest cover after edit
- Dmitry Kosolobov: Simplified Tight Bounds for Monotone Minimal Perfect Hashing
- Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie and Yuri Pirola: Solving the Minimal Positional Substring Cover problem in sublinear space
- Florin Manea, Jonas Richardsen and Markus L. Schmid: Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
- Giovanni Manzini, Alberto Policriti, Nicola Prezza and Brian Riccardi: The rational construction of a Wheeler DFA
- Philip Bille, Christian Mikkelsen Fuglsang and Inge Li Gørtz: Tight Bounds for Compressing Substring Samples
- Ian Pratt-Hartmann: Walking on words
- Dana Fisman and Ilay Tzarfati: When is the Normalized Edit Distance over Non-Uniform Weights a Metric?