<h2>LIPIcs, Volume 223, CPM 2022</h2>
<ul>
<li>
<span class="authors">Hideo Bannai and Jan Holub</span>
<span class="title">LIPIcs, Volume 223, CPM 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022">10.4230/LIPIcs.CPM.2022</a>
</li>
<li>
<span class="authors">Hideo Bannai and Jan Holub</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.0">10.4230/LIPIcs.CPM.2022.0</a>
</li>
<li>
<span class="authors">Takehiro Ito</span>
<span class="title">Invitation to Combinatorial Reconfiguration (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.1">10.4230/LIPIcs.CPM.2022.1</a>
</li>
<li>
<span class="authors">Jeffrey Shallit</span>
<span class="title">Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.2">10.4230/LIPIcs.CPM.2022.2</a>
</li>
<li>
<span class="authors">Sharma V. Thankachan</span>
<span class="title">Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.3">10.4230/LIPIcs.CPM.2022.3</a>
</li>
<li>
<span class="authors">Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, and Oren Weimann</span>
<span class="title">The Fine-Grained Complexity of Episode Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.4">10.4230/LIPIcs.CPM.2022.4</a>
</li>
<li>
<span class="authors">John Machacek</span>
<span class="title">Mechanical Proving with Walnut for Squares and Cubes in Partial Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.5">10.4230/LIPIcs.CPM.2022.5</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Mark Jones, Rolf Niedermeier, and Till Tantau</span>
<span class="title">An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.6">10.4230/LIPIcs.CPM.2022.6</a>
</li>
<li>
<span class="authors">Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, and Peng Zou</span>
<span class="title">Beyond the Longest Letter-Duplicated Subsequence Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.7">10.4230/LIPIcs.CPM.2022.7</a>
</li>
<li>
<span class="authors">Vincent Jugé</span>
<span class="title">Reduction Ratio of the IS-Algorithm: Worst and Random Cases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.8">10.4230/LIPIcs.CPM.2022.8</a>
</li>
<li>
<span class="authors">Abhinav Nellore and Rachel Ward</span>
<span class="title">Arbitrary-Length Analogs to de Bruijn Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.9">10.4230/LIPIcs.CPM.2022.9</a>
</li>
<li>
<span class="authors">Avivit Levy, Ely Porat, and B. Riva Shalom</span>
<span class="title">Partial Permutations Comparison, Maintenance and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.10">10.4230/LIPIcs.CPM.2022.10</a>
</li>
<li>
<span class="authors">Yuma Arakawa, Gonzalo Navarro, and Kunihiko Sadakane</span>
<span class="title">Bi-Directional r-Indexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.11">10.4230/LIPIcs.CPM.2022.11</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, and Michelle Sweering</span>
<span class="title">Making de Bruijn Graphs Eulerian</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.12">10.4230/LIPIcs.CPM.2022.12</a>
</li>
<li>
<span class="authors">Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, and Cyril Nicaud</span>
<span class="title">Back-To-Front Online Lyndon Forest Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.13">10.4230/LIPIcs.CPM.2022.13</a>
</li>
<li>
<span class="authors">Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, and Hiroki Arimura</span>
<span class="title">Cartesian Tree Subsequence Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.14">10.4230/LIPIcs.CPM.2022.14</a>
</li>
<li>
<span class="authors">Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, and Tadatoshi Utashima</span>
<span class="title">Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.15">10.4230/LIPIcs.CPM.2022.15</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Alessio Conte, Esteban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, and Michelle Sweering</span>
<span class="title">On Strings Having the Same Length- k Substrings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.16">10.4230/LIPIcs.CPM.2022.16</a>
</li>
<li>
<span class="authors">Dana Fisman, Joshua Grogin, Oded Margalit, and Gera Weiss</span>
<span class="title">The Normalized Edit Distance with Uniform Operation Costs Is a Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.17">10.4230/LIPIcs.CPM.2022.17</a>
</li>
<li>
<span class="authors">Raphaël Clifford, Paweł Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, and Przemysław Uznański</span>
<span class="title">The Dynamic k-Mismatch Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.18">10.4230/LIPIcs.CPM.2022.18</a>
</li>
<li>
<span class="authors">Nicola Rizzo and Veli Mäkinen</span>
<span class="title">Indexable Elastic Founder Graphs of Minimum Height</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.19">10.4230/LIPIcs.CPM.2022.19</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Solon P. Pissis, and Jakub Radoszewski</span>
<span class="title">Longest Palindromic Substring in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.20">10.4230/LIPIcs.CPM.2022.20</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Guillaume Fertin, Vincent Jugé, and Stéphane Vialette</span>
<span class="title">Permutation Pattern Matching for Doubly Partially Ordered Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.21">10.4230/LIPIcs.CPM.2022.21</a>
</li>
<li>
<span class="authors">Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Linear-Time Computation of Shortest Covers of All Rotations of a String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.22">10.4230/LIPIcs.CPM.2022.22</a>
</li>
<li>
<span class="authors">Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Rectangular Tile Covers of 2D-Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.23">10.4230/LIPIcs.CPM.2022.23</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Philippe Gambette, and Olga Seminck</span>
<span class="title">Reordering a Tree According to an Order on Its Leaves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.24">10.4230/LIPIcs.CPM.2022.24</a>
</li>
<li>
<span class="authors">Davide Cenzato and Zsuzsanna Lipták</span>
<span class="title">A Theoretical and Experimental Analysis of BWT Variants for String Collections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.25">10.4230/LIPIcs.CPM.2022.25</a>
</li>
<li>
<span class="authors">Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama</span>
<span class="title">{RePair} Grammars Are the Smallest Grammars for Fibonacci Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.26">10.4230/LIPIcs.CPM.2022.26</a>
</li>
<li>
<span class="authors">Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga</span>
<span class="title">Minimal Absent Words on Run-Length Encoded Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.27">10.4230/LIPIcs.CPM.2022.27</a>
</li>
<li>
<span class="authors">Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, and Ayumi Shinohara</span>
<span class="title">Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.28">10.4230/LIPIcs.CPM.2022.28</a>
</li>
<li>
<span class="authors">Diego Díaz-Domínguez and Gonzalo Navarro</span>
<span class="title">Efficient Construction of the BWT for Repetitive Text Using String Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2022.29">10.4230/LIPIcs.CPM.2022.29</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