LIPIcs, Volume 214, IPEC 2021

• Petr A. Golovach and Meirav Zehavi LIPIcs, Volume 214, IPEC 2021, Complete Volume 10.4230/LIPIcs.IPEC.2021
• Petr A. Golovach and Meirav Zehavi Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.IPEC.2021.0
• Akanksha Agrawal, Aditya Anand, and Saket Saurabh A Polynomial Kernel for Deletion to Ptolemaic Graphs 10.4230/LIPIcs.IPEC.2021.1
• Akanksha Agrawal, Ravi Kiran Allumalla, and Varun Teja Dhanekula Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH 10.4230/LIPIcs.IPEC.2021.2
• Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, and Maria Paula Parga Nina The Fine-Grained Complexity of Multi-Dimensional Ordering Properties 10.4230/LIPIcs.IPEC.2021.3
• Júlio Araújo, Marin Bougeret, Victor Campos, and Ignasi Sau A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover 10.4230/LIPIcs.IPEC.2021.4
• Vikraman Arvind and Venkatesan Guruswami CNF Satisfiability in a Subspace and Related Problems 10.4230/LIPIcs.IPEC.2021.5
• Jakub Balabán and Petr Hliněný Twin-Width Is Linear in the Poset Width 10.4230/LIPIcs.IPEC.2021.6
• Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, and Till Tantau Dynamic Kernels for Hitting Sets and Set Packing 10.4230/LIPIcs.IPEC.2021.7
• Gabriel Bathie, Nicolas Bousquet, and Théo Pierron (Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes 10.4230/LIPIcs.IPEC.2021.8
• Hans L. Bodlaender, Carla Groenland, and Céline M. F. Swennenhuis Parameterized Complexities of Dominating and Independent Set Reconfiguration 10.4230/LIPIcs.IPEC.2021.9
• Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, and Rémi Watrigant Twin-Width and Polynomial Kernels 10.4230/LIPIcs.IPEC.2021.10
• Laurent Bulteau, Bertrand Marchand, and Yann Ponty A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics 10.4230/LIPIcs.IPEC.2021.11
• Elisabet Burjons and Peter Rossmanith Lower Bounds for Conjunctive and Disjunctive Turing Kernels 10.4230/LIPIcs.IPEC.2021.12
• Yixin Cao and Yuping Ke Improved Kernels for Edge Modification Problems 10.4230/LIPIcs.IPEC.2021.13
• Huib Donkers, Bart M. P. Jansen, and Michał Włodarczyk Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size 10.4230/LIPIcs.IPEC.2021.14
• Guillaume Ducoffe Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width 10.4230/LIPIcs.IPEC.2021.15
• Guillaume Ducoffe Optimal Centrality Computations Within Bounded Clique-Width Graphs 10.4230/LIPIcs.IPEC.2021.16
• Maël Dumas, Anthony Perez, and Ioan Todinca Polynomial Kernels for Strictly Chordal Edge Modification Problems 10.4230/LIPIcs.IPEC.2021.17
• Andreas Emil Feldmann and Ashutosh Rai On Extended Formulations For Parameterized Steiner Trees 10.4230/LIPIcs.IPEC.2021.18
• Dennis Fischer, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger An Investigation of the Recoverable Robust Assignment Problem 10.4230/LIPIcs.IPEC.2021.19
• Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, and Cristian Riveros Dynamic Data Structures for Timed Automata Acceptance 10.4230/LIPIcs.IPEC.2021.20
• Hugo Jacob, Thomas Bellitto, Oscar Defrain, and Marcin Pilipczuk Close Relatives (Of Feedback Vertex Set), Revisited 10.4230/LIPIcs.IPEC.2021.21
• Vít Jelínek, Michal Opler, and Jakub Pekárek Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder 10.4230/LIPIcs.IPEC.2021.22
• Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, and Shaily Verma A Polynomial Kernel for Bipartite Permutation Vertex Deletion 10.4230/LIPIcs.IPEC.2021.23
• Shaohua Li and Marcin Pilipczuk Hardness of Metric Dimension in Graphs of Constant Treewidth 10.4230/LIPIcs.IPEC.2021.24
• Igor Razgon Classification of OBDD Size for Monotone 2-CNFs 10.4230/LIPIcs.IPEC.2021.25
• Leon Kellerhals, Tomohiro Koana, André Nichterlein, and Philipp Zschoche The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing 10.4230/LIPIcs.IPEC.2021.26
• Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm 10.4230/LIPIcs.IPEC.2021.27
• Alexander Bille, Dominik Brandenstein, and Emanuel Herrendorf PACE Solver Description: ADE-Solver 10.4230/LIPIcs.IPEC.2021.28
• Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters 10.4230/LIPIcs.IPEC.2021.29
• Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, and Maximilian Sonneborn PACE Solver Description: PACA-JAVA 10.4230/LIPIcs.IPEC.2021.30
• Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm 10.4230/LIPIcs.IPEC.2021.31
• Sylwester Swat PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem 10.4230/LIPIcs.IPEC.2021.32
• Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto PACE Solver Description: μSolver - Heuristic Track 10.4230/LIPIcs.IPEC.2021.33
• Martin Josef Geiger PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem 10.4230/LIPIcs.IPEC.2021.34
• Sylwester Swat PACE Solver Description: Cluster Editing Kernelization Using CluES 10.4230/LIPIcs.IPEC.2021.35