LIPIcs, Volume 249, IPEC 2022

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