<h2>LIPIcs, Volume 296, CPM 2024</h2>
<ul>
<li>
<span class="authors">Shunsuke Inenaga and Simon J. Puglisi</span>
<span class="title">LIPIcs, Volume 296, CPM 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024">10.4230/LIPIcs.CPM.2024</a>
</li>
<li>
<span class="authors">Shunsuke Inenaga and Simon J. Puglisi</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.0">10.4230/LIPIcs.CPM.2024.0</a>
</li>
<li>
<span class="authors">Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, and Nicola Prezza</span>
<span class="title">Computing the LCP Array of a Labeled Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.1">10.4230/LIPIcs.CPM.2024.1</a>
</li>
<li>
<span class="authors">Amihood Amir and Michael Itzhaki</span>
<span class="title">Reconstructing General Matching Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.2">10.4230/LIPIcs.CPM.2024.2</a>
</li>
<li>
<span class="authors">Hideo Bannai, Panagiotis Charalampopoulos, and Jakub Radoszewski</span>
<span class="title">Maintaining the Size of LZ77 on Semi-Dynamic Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.3">10.4230/LIPIcs.CPM.2024.3</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Panagiotis Charalampopoulos, and Tatiana Starikovskaya</span>
<span class="title">Internal Pattern Matching in Small Space and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.4">10.4230/LIPIcs.CPM.2024.4</a>
</li>
<li>
<span class="authors">Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, and Nicola Prezza</span>
<span class="title">Random Wheeler Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.5">10.4230/LIPIcs.CPM.2024.5</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, and Michelle Sweering</span>
<span class="title">Connecting de Bruijn Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.6">10.4230/LIPIcs.CPM.2024.6</a>
</li>
<li>
<span class="authors">Gianmarco Bertola, Anthony J. Cox, Veronica Guerrini, and Giovanna Rosone</span>
<span class="title">A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.7">10.4230/LIPIcs.CPM.2024.7</a>
</li>
<li>
<span class="authors">Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, and Simon R. Tarnow</span>
<span class="title">Faster Sliding Window String Indexing in Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.8">10.4230/LIPIcs.CPM.2024.8</a>
</li>
<li>
<span class="authors">Philip Bille, Christian Mikkelsen Fuglsang, and Inge Li Gørtz</span>
<span class="title">Tight Bounds for Compressing Substring Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.9">10.4230/LIPIcs.CPM.2024.9</a>
</li>
<li>
<span class="authors">Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclăuş, and Arseny Shur</span>
<span class="title">Searching 2D-Strings for Matching Frames</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.10">10.4230/LIPIcs.CPM.2024.10</a>
</li>
<li>
<span class="authors">Itai Boneh, Dvir Fried, Shay Golan, and Matan Kraus</span>
<span class="title">Hairpin Completion Distance Lower Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.11">10.4230/LIPIcs.CPM.2024.11</a>
</li>
<li>
<span class="authors">Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, and Yuri Pirola</span>
<span class="title">Solving the Minimal Positional Substring Cover Problem in Sublinear Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.12">10.4230/LIPIcs.CPM.2024.12</a>
</li>
<li>
<span class="authors">Bartłomiej Dudek and Paweł Gawrychowski</span>
<span class="title">Online Context-Free Recognition in OMv Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.13">10.4230/LIPIcs.CPM.2024.13</a>
</li>
<li>
<span class="authors">Dana Fisman and Ilay Tzarfati</span>
<span class="title">When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.14">10.4230/LIPIcs.CPM.2024.14</a>
</li>
<li>
<span class="authors">Daniel Gabrić and Joe Sawada</span>
<span class="title">Efficient Construction of Long Orientable Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.15">10.4230/LIPIcs.CPM.2024.15</a>
</li>
<li>
<span class="authors">Peaker Guo, Patrick Eades, Anthony Wirth, and Justin Zobel</span>
<span class="title">Exploiting New Properties of String Net Frequency for Efficient Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.16">10.4230/LIPIcs.CPM.2024.16</a>
</li>
<li>
<span class="authors">Meng He and Kaiyu Wu</span>
<span class="title">Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.17">10.4230/LIPIcs.CPM.2024.17</a>
</li>
<li>
<span class="authors">Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, and Ayumi Shinohara</span>
<span class="title">Algorithms for Galois Words: Detection, Factorization, and Rotation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.18">10.4230/LIPIcs.CPM.2024.18</a>
</li>
<li>
<span class="authors">Dmitry Kosolobov</span>
<span class="title">Simplified Tight Bounds for Monotone Minimal Perfect Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.19">10.4230/LIPIcs.CPM.2024.19</a>
</li>
<li>
<span class="authors">Dmitry Kosolobov and Nikita Sivukhin</span>
<span class="title">Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.20">10.4230/LIPIcs.CPM.2024.20</a>
</li>
<li>
<span class="authors">Zsuzsanna Lipták, Francesco Masillo, and Gonzalo Navarro</span>
<span class="title">BAT-LZ out of hell</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.21">10.4230/LIPIcs.CPM.2024.21</a>
</li>
<li>
<span class="authors">Florin Manea, Jonas Richardsen, and Markus L. Schmid</span>
<span class="title">Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.22">10.4230/LIPIcs.CPM.2024.22</a>
</li>
<li>
<span class="authors">Giovanni Manzini, Alberto Policriti, Nicola Prezza, and Brian Riccardi</span>
<span class="title">The Rational Construction of a Wheeler DFA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.23">10.4230/LIPIcs.CPM.2024.23</a>
</li>
<li>
<span class="authors">Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama</span>
<span class="title">Shortest Cover After Edit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.24">10.4230/LIPIcs.CPM.2024.24</a>
</li>
<li>
<span class="authors">Ian Pratt-Hartmann</span>
<span class="title">Walking on Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.25">10.4230/LIPIcs.CPM.2024.25</a>
</li>
<li>
<span class="authors">Yoshifumi Sakai</span>
<span class="title">A Data Structure for the Maximum-Sum Segment Problem with Offsets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.26">10.4230/LIPIcs.CPM.2024.26</a>
</li>
<li>
<span class="authors">Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, and Hiroki Arimura</span>
<span class="title">Finding Diverse Strings and Longest Common Subsequences in a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.27">10.4230/LIPIcs.CPM.2024.27</a>
</li>
<li>
<span class="authors">Hilde Verbeek, Lorraine A.K. Ayad, Grigorios Loukides, and Solon P. Pissis</span>
<span class="title">Minimizing the Minimizers via Alphabet Reordering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2024.28">10.4230/LIPIcs.CPM.2024.28</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing