<h2>LIPIcs, Volume 249, IPEC 2022</h2>
<ul>
<li>
<span class="authors">Holger Dell and Jesper Nederlof</span>
<span class="title">LIPIcs, Volume 249, IPEC 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022">10.4230/LIPIcs.IPEC.2022</a>
</li>
<li>
<span class="authors">Holger Dell and Jesper Nederlof</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.0">10.4230/LIPIcs.IPEC.2022.0</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">A Finite Algorithm for the Realizabilty of a Delaunay Triangulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.1">10.4230/LIPIcs.IPEC.2022.1</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, and Abhishek Sahu</span>
<span class="title">Parameterized Complexity of Perfectly Matched Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.2">10.4230/LIPIcs.IPEC.2022.2</a>
</li>
<li>
<span class="authors">Brage I. K. Bakkane and Lars Jaffke</span>
<span class="title">On the Hardness of Generalized Domination Problems Parameterized by Mim-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.3">10.4230/LIPIcs.IPEC.2022.3</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, and Kirill Simonov</span>
<span class="title">FPT Approximation for Fair Minimum-Load Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.4">10.4230/LIPIcs.IPEC.2022.4</a>
</li>
<li>
<span class="authors">Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, and Anna Zych-Pawlewicz</span>
<span class="title">On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.5">10.4230/LIPIcs.IPEC.2022.5</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, and Michał Pilipczuk</span>
<span class="title">On the Complexity of Problems on Tree-Structured Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.6">10.4230/LIPIcs.IPEC.2022.6</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Carla Groenland, and Hugo Jacob</span>
<span class="title">On the Parameterized Complexity of Computing Tree-Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.7">10.4230/LIPIcs.IPEC.2022.7</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, and Paloma T. Lima</span>
<span class="title">XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.8">10.4230/LIPIcs.IPEC.2022.8</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, and Stéphan Thomassé</span>
<span class="title">Twin-Width VIII: Delineation and Win-Wins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.9">10.4230/LIPIcs.IPEC.2022.9</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">Obstructions to Faster Diameter Computation: Asteroidal Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.10">10.4230/LIPIcs.IPEC.2022.10</a>
</li>
<li>
<span class="authors">Eduard Eiben, Clément Rambaud, and Magnus Wahlström</span>
<span class="title">On the Parameterized Complexity of Symmetric Directed Multicut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.11">10.4230/LIPIcs.IPEC.2022.11</a>
</li>
<li>
<span class="authors">Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, and Karol Węgrzycki</span>
<span class="title">Computing Generalized Convolutions Faster Than Brute Force</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.12">10.4230/LIPIcs.IPEC.2022.12</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, and Saket Saurabh</span>
<span class="title">Exact Exponential Algorithms for Clustering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.13">10.4230/LIPIcs.IPEC.2022.13</a>
</li>
<li>
<span class="authors">Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, and Prafullkumar Tale</span>
<span class="title">Domination and Cut Problems on Chordal Graphs with Bounded Leafage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.14">10.4230/LIPIcs.IPEC.2022.14</a>
</li>
<li>
<span class="authors">Robert Ganian and Viktoriia Korchemna</span>
<span class="title">Slim Tree-Cut Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.15">10.4230/LIPIcs.IPEC.2022.15</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">A Fixed-Parameter Algorithm for the Schrijver Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.16">10.4230/LIPIcs.IPEC.2022.16</a>
</li>
<li>
<span class="authors">Falko Hegerfeld and Stefan Kratsch</span>
<span class="title">Towards Exact Structural Thresholds for Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.17">10.4230/LIPIcs.IPEC.2022.17</a>
</li>
<li>
<span class="authors">Danny Hermelin, Yuval Itzhaki, Hendrik Molter, and Dvir Shabtay</span>
<span class="title">Hardness of Interval Scheduling on Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.18">10.4230/LIPIcs.IPEC.2022.18</a>
</li>
<li>
<span class="authors">Leon Kellerhals, Tomohiro Koana, and Pascal Kunz</span>
<span class="title">Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.19">10.4230/LIPIcs.IPEC.2022.19</a>
</li>
<li>
<span class="authors">Christian Komusiewicz and Nils Morawietz</span>
<span class="title">Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.20">10.4230/LIPIcs.IPEC.2022.20</a>
</li>
<li>
<span class="authors">Maher Mallem, Claire Hanen, and Alix Munier-Kordon</span>
<span class="title">Parameterized Complexity of a Parallel Machine Scheduling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.21">10.4230/LIPIcs.IPEC.2022.21</a>
</li>
<li>
<span class="authors">Dániel Marx, Govind S. Sankar, and Philipp Schepper</span>
<span class="title">Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.22">10.4230/LIPIcs.IPEC.2022.22</a>
</li>
<li>
<span class="authors">Yosuke Mizutani and Blair D. Sullivan</span>
<span class="title">Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.23">10.4230/LIPIcs.IPEC.2022.23</a>
</li>
<li>
<span class="authors">Jelle J. Oostveen and Erik Jan van Leeuwen</span>
<span class="title">Parameterized Complexity of Streaming Diameter and Connectivity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.24">10.4230/LIPIcs.IPEC.2022.24</a>
</li>
<li>
<span class="authors">Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, and Christopher Weyand</span>
<span class="title">Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.25">10.4230/LIPIcs.IPEC.2022.25</a>
</li>
<li>
<span class="authors">Ernestine Großmann, Tobias Heuer, Christian Schulz, and Darren Strash</span>
<span class="title">The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.26">10.4230/LIPIcs.IPEC.2022.26</a>
</li>
<li>
<span class="authors">Sylwester Swat</span>
<span class="title">PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.27">10.4230/LIPIcs.IPEC.2022.27</a>
</li>
<li>
<span class="authors">Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, and Leo Wendt</span>
<span class="title">PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.28">10.4230/LIPIcs.IPEC.2022.28</a>
</li>
<li>
<span class="authors">YuMing Du, QingYun Zhang, JunZhou Xu, ShunGen Zhang, Chao Liao, ZhiHuai Chen, ZhiBo Sun, ZhouXing Su, JunWen Ding, Chen Wu, PinYan Lu, and ZhiPeng Lv</span>
<span class="title">PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.29">10.4230/LIPIcs.IPEC.2022.29</a>
</li>
<li>
<span class="authors">Moritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, and Sebastian Siebertz</span>
<span class="title">PACE Solver Description: GraPA-JAVA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.30">10.4230/LIPIcs.IPEC.2022.30</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Gaétan Berthe, Yoann Coudert-Osmont, David Desobry, Amadeus Reinald, and Mathis Rocton</span>
<span class="title">PACE Solver Description: DreyFVS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.31">10.4230/LIPIcs.IPEC.2022.31</a>
</li>
<li>
<span class="authors">Rafael Kiesel and André Schidler</span>
<span class="title">PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2022.32">10.4230/LIPIcs.IPEC.2022.32</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