LIPIcs, Volume 296, CPM 2024

• Shunsuke Inenaga and Simon J. Puglisi LIPIcs, Volume 296, CPM 2024, Complete Volume 10.4230/LIPIcs.CPM.2024
• Shunsuke Inenaga and Simon J. Puglisi Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CPM.2024.0
• Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, and Nicola Prezza Computing the LCP Array of a Labeled Graph 10.4230/LIPIcs.CPM.2024.1
• Amihood Amir and Michael Itzhaki Reconstructing General Matching Graphs 10.4230/LIPIcs.CPM.2024.2
• Hideo Bannai, Panagiotis Charalampopoulos, and Jakub Radoszewski Maintaining the Size of LZ77 on Semi-Dynamic Strings 10.4230/LIPIcs.CPM.2024.3
• Gabriel Bathie, Panagiotis Charalampopoulos, and Tatiana Starikovskaya Internal Pattern Matching in Small Space and Applications 10.4230/LIPIcs.CPM.2024.4
• Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, and Nicola Prezza Random Wheeler Automata 10.4230/LIPIcs.CPM.2024.5
• Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, and Michelle Sweering Connecting de Bruijn Graphs 10.4230/LIPIcs.CPM.2024.6
• 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 10.4230/LIPIcs.CPM.2024.7
• Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, and Simon R. Tarnow Faster Sliding Window String Indexing in Streams 10.4230/LIPIcs.CPM.2024.8
• Philip Bille, Christian Mikkelsen Fuglsang, and Inge Li Gørtz Tight Bounds for Compressing Substring Samples 10.4230/LIPIcs.CPM.2024.9
• Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclăuş, and Arseny Shur Searching 2D-Strings for Matching Frames 10.4230/LIPIcs.CPM.2024.10
• Itai Boneh, Dvir Fried, Shay Golan, and Matan Kraus Hairpin Completion Distance Lower Bound 10.4230/LIPIcs.CPM.2024.11
• Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, and Yuri Pirola Solving the Minimal Positional Substring Cover Problem in Sublinear Space 10.4230/LIPIcs.CPM.2024.12
• Bartłomiej Dudek and Paweł Gawrychowski Online Context-Free Recognition in OMv Time 10.4230/LIPIcs.CPM.2024.13
• Dana Fisman and Ilay Tzarfati When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? 10.4230/LIPIcs.CPM.2024.14
• Daniel Gabrić and Joe Sawada Efficient Construction of Long Orientable Sequences 10.4230/LIPIcs.CPM.2024.15
• Peaker Guo, Patrick Eades, Anthony Wirth, and Justin Zobel Exploiting New Properties of String Net Frequency for Efficient Computation 10.4230/LIPIcs.CPM.2024.16
• Meng He and Kaiyu Wu Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs 10.4230/LIPIcs.CPM.2024.17
• Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, and Ayumi Shinohara Algorithms for Galois Words: Detection, Factorization, and Rotation 10.4230/LIPIcs.CPM.2024.18
• Dmitry Kosolobov Simplified Tight Bounds for Monotone Minimal Perfect Hashing 10.4230/LIPIcs.CPM.2024.19
• Dmitry Kosolobov and Nikita Sivukhin Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space 10.4230/LIPIcs.CPM.2024.20
• Zsuzsanna Lipták, Francesco Masillo, and Gonzalo Navarro BAT-LZ out of hell 10.4230/LIPIcs.CPM.2024.21
• Florin Manea, Jonas Richardsen, and Markus L. Schmid Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds 10.4230/LIPIcs.CPM.2024.22
• Giovanni Manzini, Alberto Policriti, Nicola Prezza, and Brian Riccardi The Rational Construction of a Wheeler DFA 10.4230/LIPIcs.CPM.2024.23
• Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama Shortest Cover After Edit 10.4230/LIPIcs.CPM.2024.24
• Ian Pratt-Hartmann Walking on Words 10.4230/LIPIcs.CPM.2024.25
• Yoshifumi Sakai A Data Structure for the Maximum-Sum Segment Problem with Offsets 10.4230/LIPIcs.CPM.2024.26
• Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, and Hiroki Arimura Finding Diverse Strings and Longest Common Subsequences in a Graph 10.4230/LIPIcs.CPM.2024.27
• Hilde Verbeek, Lorraine A.K. Ayad, Grigorios Loukides, and Solon P. Pissis Minimizing the Minimizers via Alphabet Reordering 10.4230/LIPIcs.CPM.2024.28