<h2>LIPIcs, Volume 321, IPEC 2024</h2>
<ul>
<li>
<span class="authors">Édouard Bonnet and Paweł Rzążewski</span>
<span class="title">LIPIcs, Volume 321, IPEC 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024">10.4230/LIPIcs.IPEC.2024</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Paweł Rzążewski</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.0">10.4230/LIPIcs.IPEC.2024.0</a>
</li>
<li>
<span class="authors">Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, and Ziena Zeif</span>
<span class="title">Combining Crown Structures for Vulnerability Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.1">10.4230/LIPIcs.IPEC.2024.1</a>
</li>
<li>
<span class="authors">Jonas Lill, Kalina Petrova, and Simon Weber</span>
<span class="title">Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.2">10.4230/LIPIcs.IPEC.2024.2</a>
</li>
<li>
<span class="authors">Jakub Balabán, Robert Ganian, and Mathis Rocton</span>
<span class="title">Twin-Width Meets Feedback Edges and Vertex Integrity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.3">10.4230/LIPIcs.IPEC.2024.3</a>
</li>
<li>
<span class="authors">Václav Blažej, Satyabrata Jana, M. S. Ramanujan, and Peter Strulo</span>
<span class="title">On the Parameterized Complexity of Eulerian Strong Component Arc Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.4">10.4230/LIPIcs.IPEC.2024.4</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Fabrizio Grandoni, and Ariel Kulik</span>
<span class="title">Unsplittable Flow on a Short Path</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.5">10.4230/LIPIcs.IPEC.2024.5</a>
</li>
<li>
<span class="authors"> Karthik C. S., Euiwoong Lee, and Pasin Manurangsi</span>
<span class="title">On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.6">10.4230/LIPIcs.IPEC.2024.6</a>
</li>
<li>
<span class="authors">Václav Blažej, Sushmita Gupta, M. S. Ramanujan, and Peter Strulo</span>
<span class="title">On Controlling Knockout Tournaments Without Perfect Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.7">10.4230/LIPIcs.IPEC.2024.7</a>
</li>
<li>
<span class="authors">Ishay Haviv and Dror Rabinovich</span>
<span class="title">Kernelization for Orthogonality Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.8">10.4230/LIPIcs.IPEC.2024.8</a>
</li>
<li>
<span class="authors">Marvin Künnemann and Mirza Redzic</span>
<span class="title">Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.9">10.4230/LIPIcs.IPEC.2024.9</a>
</li>
<li>
<span class="authors">Tomohiro Koana, Nidhi Purohit, and Kirill Simonov</span>
<span class="title">Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.10">10.4230/LIPIcs.IPEC.2024.10</a>
</li>
<li>
<span class="authors">Yuxi Liu and Mingyu Xiao</span>
<span class="title">Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.11">10.4230/LIPIcs.IPEC.2024.11</a>
</li>
<li>
<span class="authors">Carla Groenland, Jesper Nederlof, and Tomohiro Koana</span>
<span class="title">A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.12">10.4230/LIPIcs.IPEC.2024.12</a>
</li>
<li>
<span class="authors">Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond</span>
<span class="title">Kick the Cliques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.13">10.4230/LIPIcs.IPEC.2024.13</a>
</li>
<li>
<span class="authors">Matthias Bentert, Fedor V. Fomin, Fanny Hauser, and Saket Saurabh</span>
<span class="title">The Parameterized Complexity Landscape of Two-Sets Cut-Uncut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.14">10.4230/LIPIcs.IPEC.2024.14</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F. A. Verhaegh</span>
<span class="title">Preprocessing to Reduce the Search Space for Odd Cycle Transversal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.15">10.4230/LIPIcs.IPEC.2024.15</a>
</li>
<li>
<span class="authors">Jaroslav Garvardt and Christian Komusiewicz</span>
<span class="title">Modularity Clustering Parameterized by Max Leaf Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.16">10.4230/LIPIcs.IPEC.2024.16</a>
</li>
<li>
<span class="authors">Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh</span>
<span class="title">Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.17">10.4230/LIPIcs.IPEC.2024.17</a>
</li>
<li>
<span class="authors">Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis</span>
<span class="title">Parameterised Distance to Local Irregularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.18">10.4230/LIPIcs.IPEC.2024.18</a>
</li>
<li>
<span class="authors">Matthias Kaul, Matthias Mnich, and Hendrik Molter</span>
<span class="title">Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.19">10.4230/LIPIcs.IPEC.2024.19</a>
</li>
<li>
<span class="authors">Paul Bastide and Carla Groenland</span>
<span class="title">Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.20">10.4230/LIPIcs.IPEC.2024.20</a>
</li>
<li>
<span class="authors">Jakob Greilhuber and Roohani Sharma</span>
<span class="title">Component Order Connectivity Admits No Polynomial Kernel Parameterized by the Distance to Subdivided Comb Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.21">10.4230/LIPIcs.IPEC.2024.21</a>
</li>
<li>
<span class="authors">Anna Zych-Pawlewicz and Marek Żochowski</span>
<span class="title">Dynamic Parameterized Feedback Problems in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.22">10.4230/LIPIcs.IPEC.2024.22</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, and Amer E. Mouawad</span>
<span class="title">Parameterized Shortest Path Reconfiguration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.23">10.4230/LIPIcs.IPEC.2024.23</a>
</li>
<li>
<span class="authors">Henning Fernau and Kevin Mann</span>
<span class="title">Roman Hitting Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.24">10.4230/LIPIcs.IPEC.2024.24</a>
</li>
<li>
<span class="authors">Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos</span>
<span class="title">Matching (Multi)Cut: Algorithms, Complexity, and Enumeration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.25">10.4230/LIPIcs.IPEC.2024.25</a>
</li>
<li>
<span class="authors">Philipp Kindermann, Fabian Klute, and Soeren Terziadis</span>
<span class="title">The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.26">10.4230/LIPIcs.IPEC.2024.26</a>
</li>
<li>
<span class="authors">Michael Jünger, Paul J. Jünger, Petra Mutzel, and Gerhard Reinelt</span>
<span class="title">PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.27">10.4230/LIPIcs.IPEC.2024.27</a>
</li>
<li>
<span class="authors">Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, and Marcel Wienöbst</span>
<span class="title">PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.28">10.4230/LIPIcs.IPEC.2024.28</a>
</li>
<li>
<span class="authors">Alexander Dobler</span>
<span class="title">PACE Solver Description: CRGone</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.29">10.4230/LIPIcs.IPEC.2024.29</a>
</li>
<li>
<span class="authors">Tobias Röhr and Kirill Simonov</span>
<span class="title">PACE Solver Description: Crossy - An Exact Solver for One-Sided Crossing Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.30">10.4230/LIPIcs.IPEC.2024.30</a>
</li>
<li>
<span class="authors">Carlos Segura, Lázaro Lugo, Gara Miranda, and Edison David Serrano Cárdenas</span>
<span class="title">PACE Solver Description: CIMAT_Team</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.31">10.4230/LIPIcs.IPEC.2024.31</a>
</li>
<li>
<span class="authors">Martin Josef Geiger</span>
<span class="title">PACE Solver Description: Martin_J_Geiger</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.32">10.4230/LIPIcs.IPEC.2024.32</a>
</li>
<li>
<span class="authors">Kimon Boehmer, Lukas Lee George, Fanny Hauser, and Jesse Palarus</span>
<span class="title">PACE Solver Description: Arcee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.33">10.4230/LIPIcs.IPEC.2024.33</a>
</li>
<li>
<span class="authors">Kenneth Langedal, Matthias Bentert, Thorgal Blanco, and Pål Grønås Drange</span>
<span class="title">PACE Solver Description: LUNCH - Linear Uncrossing Heuristics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.34">10.4230/LIPIcs.IPEC.2024.34</a>
</li>
<li>
<span class="authors">Ragnar Groot Koerkamp and Mees de Vries</span>
<span class="title">PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2024.35">10.4230/LIPIcs.IPEC.2024.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