LIPIcs, Volume 321, IPEC 2024

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