<h2>LIPIcs, Volume 285, IPEC 2023</h2>
<ul>
<li>
<span class="authors">Neeldhara Misra and Magnus Wahlström</span>
<span class="title">LIPIcs, Volume 285, IPEC 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023">10.4230/LIPIcs.IPEC.2023</a>
</li>
<li>
<span class="authors">Neeldhara Misra and Magnus Wahlström</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.0">10.4230/LIPIcs.IPEC.2023.0</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, and Petra Wolf</span>
<span class="title">Kernelizing Temporal Exploration Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.1">10.4230/LIPIcs.IPEC.2023.1</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, and Petra Wolf</span>
<span class="title">Cluster Editing with Overlapping Communities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.2">10.4230/LIPIcs.IPEC.2023.2</a>
</li>
<li>
<span class="authors">Max Bannach, Florian Chudigiewitsch, and Till Tantau</span>
<span class="title">Existential Second-Order Logic over Graphs: Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.3">10.4230/LIPIcs.IPEC.2023.3</a>
</li>
<li>
<span class="authors">Matthias Bentert, Jannik Schestag, and Frank Sommer</span>
<span class="title">On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.4">10.4230/LIPIcs.IPEC.2023.4</a>
</li>
<li>
<span class="authors">Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, and Roohani Sharma</span>
<span class="title">Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.5">10.4230/LIPIcs.IPEC.2023.5</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, and Erik Jan van Leeuwen</span>
<span class="title">The Parameterised Complexity Of Integer Multicommodity Flow</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.6">10.4230/LIPIcs.IPEC.2023.6</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma T. Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, and Ondřej Suchý</span>
<span class="title">Treewidth Is NP-Complete on Cubic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.7">10.4230/LIPIcs.IPEC.2023.7</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Julien Duron</span>
<span class="title">Stretch-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.8">10.4230/LIPIcs.IPEC.2023.8</a>
</li>
<li>
<span class="authors">Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinicius F. dos Santos, and Tom C. van der Zanden</span>
<span class="title">Minimum Separator Reconfiguration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.9">10.4230/LIPIcs.IPEC.2023.9</a>
</li>
<li>
<span class="authors">Juhi Chaudhary, Harmender Gahlawat, Michal Włodarczyk, and Meirav Zehavi</span>
<span class="title">Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.10">10.4230/LIPIcs.IPEC.2023.10</a>
</li>
<li>
<span class="authors">Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, and Roohani Sharma</span>
<span class="title">Parameterized Complexity Classification for Interval Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.11">10.4230/LIPIcs.IPEC.2023.11</a>
</li>
<li>
<span class="authors">Riccardo Dondi and Manuel Lafond</span>
<span class="title">An FPT Algorithm for Temporal Graph Untangling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.12">10.4230/LIPIcs.IPEC.2023.12</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">Budgeted Matroid Maximization: a Parameterized Viewpoint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.13">10.4230/LIPIcs.IPEC.2023.13</a>
</li>
<li>
<span class="authors">Pål Grønås Drange, Patrick Greaves, Irene Muzi, and Felix Reidl</span>
<span class="title">Computing Complexity Measures of Degenerate Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.14">10.4230/LIPIcs.IPEC.2023.14</a>
</li>
<li>
<span class="authors">Maël Dumas and Anthony Perez</span>
<span class="title">An Improved Kernelization Algorithm for Trivially Perfect Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.15">10.4230/LIPIcs.IPEC.2023.15</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider</span>
<span class="title">From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.16">10.4230/LIPIcs.IPEC.2023.16</a>
</li>
<li>
<span class="authors">Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, and Roohani Sharma</span>
<span class="title">Approximate Monotone Local Search for Weighted Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.17">10.4230/LIPIcs.IPEC.2023.17</a>
</li>
<li>
<span class="authors">Robert Ganian, Liana Khazaliya, and Kirill Simonov</span>
<span class="title">Consistency Checking Problems: A Gateway to Parameterized Sample Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.18">10.4230/LIPIcs.IPEC.2023.18</a>
</li>
<li>
<span class="authors">Jaroslav Garvardt, Malte Renken, Jannik Schestag, and Mathias Weller</span>
<span class="title">Finding Degree-Constrained Acyclic Orientations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.19">10.4230/LIPIcs.IPEC.2023.19</a>
</li>
<li>
<span class="authors">Jaroslav Garvardt, Nils Morawietz, André Nichterlein, and Mathias Weller</span>
<span class="title">Graph Clustering Problems Under the Lens of Parameterized Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.20">10.4230/LIPIcs.IPEC.2023.20</a>
</li>
<li>
<span class="authors">Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, and Manolis Vasilakis</span>
<span class="title">Bandwidth Parameterized by Cluster Vertex Deletion Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.21">10.4230/LIPIcs.IPEC.2023.21</a>
</li>
<li>
<span class="authors">Siddharth Gupta, Guy Sa'ar, and Meirav Zehavi</span>
<span class="title">Collective Graph Exploration Parameterized by Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.22">10.4230/LIPIcs.IPEC.2023.22</a>
</li>
<li>
<span class="authors">Siddharth Gupta, Guy Sa'ar, and Meirav Zehavi</span>
<span class="title">Drawn Tree Decomposition: New Approach for Graph Drawing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.23">10.4230/LIPIcs.IPEC.2023.23</a>
</li>
<li>
<span class="authors">Klaus Heeger, Danny Hermelin, and Dvir Shabtay</span>
<span class="title">Single Machine Scheduling with Few Deadlines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.24">10.4230/LIPIcs.IPEC.2023.24</a>
</li>
<li>
<span class="authors">Irene Heinrich and Simon Raßmann</span>
<span class="title">Twin-Width of Graphs with Tree-Structured Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.25">10.4230/LIPIcs.IPEC.2023.25</a>
</li>
<li>
<span class="authors">Lars Jaffke, Laure Morelle, Ignasi Sau, and Dimitrios M. Thilikos</span>
<span class="title">Dynamic Programming on Bipartite Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.26">10.4230/LIPIcs.IPEC.2023.26</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Bart van der Steenhoven</span>
<span class="title">Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.27">10.4230/LIPIcs.IPEC.2023.27</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Shivesh K. Roy</span>
<span class="title">On the Parameterized Complexity of Multiway Near-Separator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.28">10.4230/LIPIcs.IPEC.2023.28</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Shivesh K. Roy</span>
<span class="title">Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.29">10.4230/LIPIcs.IPEC.2023.29</a>
</li>
<li>
<span class="authors">Mark Jones and Jannik Schestag</span>
<span class="title">How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.30">10.4230/LIPIcs.IPEC.2023.30</a>
</li>
<li>
<span class="authors">Ioannis Koutis, Michał Włodarczyk, and Meirav Zehavi</span>
<span class="title">Sidestepping Barriers for Dominating Set in Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.31">10.4230/LIPIcs.IPEC.2023.31</a>
</li>
<li>
<span class="authors">Stefan Kratsch and Pascal Kunz</span>
<span class="title">Approximate Turing Kernelization and Lower Bounds for Domination Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.32">10.4230/LIPIcs.IPEC.2023.32</a>
</li>
<li>
<span class="authors">Mathieu Mari, Timothé Picavet, and Michał Pilipczuk</span>
<span class="title">A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.33">10.4230/LIPIcs.IPEC.2023.33</a>
</li>
<li>
<span class="authors">Hisao Tamaki</span>
<span class="title">A Contraction-Recursive Algorithm for Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.34">10.4230/LIPIcs.IPEC.2023.34</a>
</li>
<li>
<span class="authors">Max Bannach and Sebastian Berndt</span>
<span class="title">PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.35">10.4230/LIPIcs.IPEC.2023.35</a>
</li>
<li>
<span class="authors">Yosuke Mizutani, David Dursteler, and Blair D. Sullivan</span>
<span class="title">PACE Solver Description: Hydra Prime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.36">10.4230/LIPIcs.IPEC.2023.36</a>
</li>
<li>
<span class="authors">Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, and Manuel Penschuck</span>
<span class="title">PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.37">10.4230/LIPIcs.IPEC.2023.37</a>
</li>
<li>
<span class="authors">Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, and Mathis Rocton</span>
<span class="title">PACE Solver Description: Touiouidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.38">10.4230/LIPIcs.IPEC.2023.38</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, and Petra Wolf</span>
<span class="title">PACE Solver Description: Zygosity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.39">10.4230/LIPIcs.IPEC.2023.39</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Julien Duron</span>
<span class="title">PACE Solver Description: RedAlert - Heuristic Track</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2023.40">10.4230/LIPIcs.IPEC.2023.40</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