<h2>LIPIcs, Volume 214, IPEC 2021</h2>
<ul>
<li>
<span class="authors">Petr A. Golovach and Meirav Zehavi</span>
<span class="title">LIPIcs, Volume 214, IPEC 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021">10.4230/LIPIcs.IPEC.2021</a>
</li>
<li>
<span class="authors">Petr A. Golovach and Meirav Zehavi</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.0">10.4230/LIPIcs.IPEC.2021.0</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Aditya Anand, and Saket Saurabh</span>
<span class="title">A Polynomial Kernel for Deletion to Ptolemaic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.1">10.4230/LIPIcs.IPEC.2021.1</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Ravi Kiran Allumalla, and Varun Teja Dhanekula</span>
<span class="title">Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.2">10.4230/LIPIcs.IPEC.2021.2</a>
</li>
<li>
<span class="authors">Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, and Maria Paula Parga Nina</span>
<span class="title">The Fine-Grained Complexity of Multi-Dimensional Ordering Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.3">10.4230/LIPIcs.IPEC.2021.3</a>
</li>
<li>
<span class="authors">Júlio Araújo, Marin Bougeret, Victor Campos, and Ignasi Sau</span>
<span class="title">A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.4">10.4230/LIPIcs.IPEC.2021.4</a>
</li>
<li>
<span class="authors">Vikraman Arvind and Venkatesan Guruswami</span>
<span class="title">CNF Satisfiability in a Subspace and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.5">10.4230/LIPIcs.IPEC.2021.5</a>
</li>
<li>
<span class="authors">Jakub Balabán and Petr Hliněný</span>
<span class="title">Twin-Width Is Linear in the Poset Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.6">10.4230/LIPIcs.IPEC.2021.6</a>
</li>
<li>
<span class="authors">Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, and Till Tantau</span>
<span class="title">Dynamic Kernels for Hitting Sets and Set Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.7">10.4230/LIPIcs.IPEC.2021.7</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Nicolas Bousquet, and Théo Pierron</span>
<span class="title">(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.8">10.4230/LIPIcs.IPEC.2021.8</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Carla Groenland, and Céline M. F. Swennenhuis</span>
<span class="title">Parameterized Complexities of Dominating and Independent Set Reconfiguration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.9">10.4230/LIPIcs.IPEC.2021.9</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, and Rémi Watrigant</span>
<span class="title">Twin-Width and Polynomial Kernels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.10">10.4230/LIPIcs.IPEC.2021.10</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Bertrand Marchand, and Yann Ponty</span>
<span class="title">A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.11">10.4230/LIPIcs.IPEC.2021.11</a>
</li>
<li>
<span class="authors">Elisabet Burjons and Peter Rossmanith</span>
<span class="title">Lower Bounds for Conjunctive and Disjunctive Turing Kernels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.12">10.4230/LIPIcs.IPEC.2021.12</a>
</li>
<li>
<span class="authors">Yixin Cao and Yuping Ke</span>
<span class="title">Improved Kernels for Edge Modification Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.13">10.4230/LIPIcs.IPEC.2021.13</a>
</li>
<li>
<span class="authors">Huib Donkers, Bart M. P. Jansen, and Michał Włodarczyk</span>
<span class="title">Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.14">10.4230/LIPIcs.IPEC.2021.14</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.15">10.4230/LIPIcs.IPEC.2021.15</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">Optimal Centrality Computations Within Bounded Clique-Width Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.16">10.4230/LIPIcs.IPEC.2021.16</a>
</li>
<li>
<span class="authors">Maël Dumas, Anthony Perez, and Ioan Todinca</span>
<span class="title">Polynomial Kernels for Strictly Chordal Edge Modification Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.17">10.4230/LIPIcs.IPEC.2021.17</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann and Ashutosh Rai</span>
<span class="title">On Extended Formulations For Parameterized Steiner Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.18">10.4230/LIPIcs.IPEC.2021.18</a>
</li>
<li>
<span class="authors">Dennis Fischer, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger</span>
<span class="title">An Investigation of the Recoverable Robust Assignment Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.19">10.4230/LIPIcs.IPEC.2021.19</a>
</li>
<li>
<span class="authors">Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, and Cristian Riveros</span>
<span class="title">Dynamic Data Structures for Timed Automata Acceptance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.20">10.4230/LIPIcs.IPEC.2021.20</a>
</li>
<li>
<span class="authors">Hugo Jacob, Thomas Bellitto, Oscar Defrain, and Marcin Pilipczuk</span>
<span class="title">Close Relatives (Of Feedback Vertex Set), Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.21">10.4230/LIPIcs.IPEC.2021.21</a>
</li>
<li>
<span class="authors">Vít Jelínek, Michal Opler, and Jakub Pekárek</span>
<span class="title">Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.22">10.4230/LIPIcs.IPEC.2021.22</a>
</li>
<li>
<span class="authors">Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, and Shaily Verma</span>
<span class="title">A Polynomial Kernel for Bipartite Permutation Vertex Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.23">10.4230/LIPIcs.IPEC.2021.23</a>
</li>
<li>
<span class="authors">Shaohua Li and Marcin Pilipczuk</span>
<span class="title">Hardness of Metric Dimension in Graphs of Constant Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.24">10.4230/LIPIcs.IPEC.2021.24</a>
</li>
<li>
<span class="authors">Igor Razgon</span>
<span class="title">Classification of OBDD Size for Monotone 2-CNFs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.25">10.4230/LIPIcs.IPEC.2021.25</a>
</li>
<li>
<span class="authors">Leon Kellerhals, Tomohiro Koana, André Nichterlein, and Philipp Zschoche</span>
<span class="title">The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.26">10.4230/LIPIcs.IPEC.2021.26</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm</span>
<span class="title">PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.27">10.4230/LIPIcs.IPEC.2021.27</a>
</li>
<li>
<span class="authors">Alexander Bille, Dominik Brandenstein, and Emanuel Herrendorf</span>
<span class="title">PACE Solver Description: ADE-Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.28">10.4230/LIPIcs.IPEC.2021.28</a>
</li>
<li>
<span class="authors">Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto</span>
<span class="title">PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.29">10.4230/LIPIcs.IPEC.2021.29</a>
</li>
<li>
<span class="authors">Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, and Maximilian Sonneborn</span>
<span class="title">PACE Solver Description: PACA-JAVA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.30">10.4230/LIPIcs.IPEC.2021.30</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm</span>
<span class="title">PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.31">10.4230/LIPIcs.IPEC.2021.31</a>
</li>
<li>
<span class="authors">Sylwester Swat</span>
<span class="title">PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.32">10.4230/LIPIcs.IPEC.2021.32</a>
</li>
<li>
<span class="authors">Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto</span>
<span class="title">PACE Solver Description: μSolver - Heuristic Track</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.33">10.4230/LIPIcs.IPEC.2021.33</a>
</li>
<li>
<span class="authors">Martin Josef Geiger</span>
<span class="title">PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.34">10.4230/LIPIcs.IPEC.2021.34</a>
</li>
<li>
<span class="authors">Sylwester Swat</span>
<span class="title">PACE Solver Description: Cluster Editing Kernelization Using CluES</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2021.35">10.4230/LIPIcs.IPEC.2021.35</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