<h2>LIPIcs, Volume 259, CPM 2023</h2>
<ul>
<li>
<span class="authors">Laurent Bulteau and Zsuzsanna Lipták</span>
<span class="title">LIPIcs, Volume 259, CPM 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023">10.4230/LIPIcs.CPM.2023</a>
</li>
<li>
<span class="authors">Laurent Bulteau and Zsuzsanna Lipták</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.0">10.4230/LIPIcs.CPM.2023.0</a>
</li>
<li>
<span class="authors">Diego Arroyuelo and Juan Pablo Castillo</span>
<span class="title">Trie-Compressed Adaptive Set Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.1">10.4230/LIPIcs.CPM.2023.1</a>
</li>
<li>
<span class="authors">Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, and Shunichi Tanaka</span>
<span class="title">Approximation Algorithms for the Longest Run Subsequence Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.2">10.4230/LIPIcs.CPM.2023.2</a>
</li>
<li>
<span class="authors">Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, and Takeaki Uno</span>
<span class="title">Optimal LZ-End Parsing Is Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.3">10.4230/LIPIcs.CPM.2023.3</a>
</li>
<li>
<span class="authors">Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, and Tord Joakim Stordalen</span>
<span class="title">Sliding Window String Indexing in Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.4">10.4230/LIPIcs.CPM.2023.4</a>
</li>
<li>
<span class="authors">Itai Boneh, Dvir Fried, Adrian Miclăuş, and Alexandru Popa</span>
<span class="title">Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.5">10.4230/LIPIcs.CPM.2023.5</a>
</li>
<li>
<span class="authors">Pierre Bourhis, Aaron Boussidan, and Philippe Gambette</span>
<span class="title">On Distances Between Words with Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.6">10.4230/LIPIcs.CPM.2023.6</a>
</li>
<li>
<span class="authors">Manuel Cáceres</span>
<span class="title">Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.7">10.4230/LIPIcs.CPM.2023.7</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Bartłomiej Dudek, Paweł Gawrychowski, and Karol Pokorski</span>
<span class="title">Optimal Near-Linear Space Heaviest Induced Ancestors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.8">10.4230/LIPIcs.CPM.2023.8</a>
</li>
<li>
<span class="authors">Massimo Equi, Arianne Meijer-van de Griend, and Veli Mäkinen</span>
<span class="title">From Bit-Parallelism to Quantum String Matching for Labelled Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.9">10.4230/LIPIcs.CPM.2023.9</a>
</li>
<li>
<span class="authors">Gabriele Fici, Giuseppe Romana, Marinella Sciortino, and Cristian Urbina</span>
<span class="title">On the Impact of Morphisms on BWT-Runs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.10">10.4230/LIPIcs.CPM.2023.10</a>
</li>
<li>
<span class="authors">Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, and Wiktor Zuba</span>
<span class="title">Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.11">10.4230/LIPIcs.CPM.2023.11</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, and Teresa Anna Steiner</span>
<span class="title">Compressed Indexing for Consecutive Occurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.12">10.4230/LIPIcs.CPM.2023.12</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Samah Ghazawi, and Gad M. Landau</span>
<span class="title">Order-Preserving Squares in Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.13">10.4230/LIPIcs.CPM.2023.13</a>
</li>
<li>
<span class="authors">Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, and Wing-Kin Sung</span>
<span class="title">MUL-Tree Pruning for Consistency and Compatibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.14">10.4230/LIPIcs.CPM.2023.14</a>
</li>
<li>
<span class="authors">Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.15">10.4230/LIPIcs.CPM.2023.15</a>
</li>
<li>
<span class="authors">Sung-Hwan Kim, Francisco Olivares, and Nicola Prezza</span>
<span class="title">Faster Prefix-Sorting Algorithms for Deterministic Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.16">10.4230/LIPIcs.CPM.2023.16</a>
</li>
<li>
<span class="authors">Dominik Köppl</span>
<span class="title">Encoding Hard String Problems with Answer Set Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.17">10.4230/LIPIcs.CPM.2023.17</a>
</li>
<li>
<span class="authors">Christian Komusiewicz, Simone Linz, Nils Morawietz, and Jannik Schestag</span>
<span class="title">On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.18">10.4230/LIPIcs.CPM.2023.18</a>
</li>
<li>
<span class="authors">Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, and Yonathan Sadia</span>
<span class="title">String Factorization via Prefix Free Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.19">10.4230/LIPIcs.CPM.2023.19</a>
</li>
<li>
<span class="authors">Gregory Kucherov and Steven Skiena</span>
<span class="title">Improving the Sensitivity of MinHash Through Hash-Value Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.20">10.4230/LIPIcs.CPM.2023.20</a>
</li>
<li>
<span class="authors">Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, and Wiktor Zuba</span>
<span class="title">Suffix-Prefix Queries on a Dictionary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.21">10.4230/LIPIcs.CPM.2023.21</a>
</li>
<li>
<span class="authors">Gene Myers</span>
<span class="title">Merging Sorted Lists of Similar Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.22">10.4230/LIPIcs.CPM.2023.22</a>
</li>
<li>
<span class="authors">Shinya Nagashita and Tomohiro I</span>
<span class="title">PalFM-Index: FM-Index for Palindrome Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.23">10.4230/LIPIcs.CPM.2023.23</a>
</li>
<li>
<span class="authors">Gonzalo Navarro</span>
<span class="title">Computing MEMs on Repetitive Text Collections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.24">10.4230/LIPIcs.CPM.2023.24</a>
</li>
<li>
<span class="authors">Gonzalo Navarro and Cristian Urbina</span>
<span class="title">L-Systems for Measuring Repetitiveness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.25">10.4230/LIPIcs.CPM.2023.25</a>
</li>
<li>
<span class="authors">Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, and Travis Gagie</span>
<span class="title">MONI Can Find k-MEMs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2023.26">10.4230/LIPIcs.CPM.2023.26</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