Table of Contents

• PACE Solver Description: KaPoCE: A Heuristic Cluster Editing AlgorithmThomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm. [doi]
• Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic SizeHuib Donkers, Bart M. P. Jansen, Michal Wlodarczyk 0001. [doi]
• Dynamic Kernels for Hitting Sets and Set PackingMax Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau. [doi]
• PACE Solver Description: Cluster Editing Kernelization Using CluESSylwester Swat. [doi]
• Optimal Centrality Computations Within Bounded Clique-Width GraphsGuillaume Ducoffe . [doi]
• Parameterized Complexities of Dominating and Independent Set ReconfigurationHans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Classification of OBDD Size for Monotone 2-CNFsIgor Razgon. [doi]
• Dynamic Data Structures for Timed Automata AcceptanceAlejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros. [doi]
• Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETHAkanksha Agrawal, Ravi Kiran Allumalla, Varun Teja Dhanekula. [doi]
• PACE Solver Description: PACA-JAVAJona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn. [doi]
• Improved Kernels for Edge Modification ProblemsYixin Cao 0001, Yuping Ke. [doi]
• Close Relatives (Of Feedback Vertex Set), RevisitedHugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk. [doi]
• PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing ProblemMartin Josef Geiger. [doi]
• The Fine-Grained Complexity of Multi-Dimensional Ordering PropertiesHaozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina. [doi]
• Lower Bounds for Conjunctive and Disjunctive Turing KernelsElisabet Burjons, Peter Rossmanith. [doi]
• PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards ClustersValentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto. [doi]
• On Extended Formulations For Parameterized Steiner TreesAndreas Emil Feldmann, Ashutosh Rai 0001. [doi]
• PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing ProblemSylwester Swat. [doi]
• Polynomial Kernels for Strictly Chordal Edge Modification ProblemsMaël Dumas, Anthony Perez 0001, Ioan Todinca. [doi]
• The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster EditingLeon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche. [doi]
• PACE Solver Description: μSolver - Heuristic TrackValentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto. [doi]
• A New Parametrization for Independent Set Reconfiguration and Applications to RNA KineticsLaurent Bulteau, Bertrand Marchand, Yann Ponty. [doi]
• (Sub)linear Kernels for Edge Modification Problems Towards Structured Graph ClassesGabriel Bathie, Nicolas Bousquet, Théo Pierron. [doi]
• Hardness of Metric Dimension in Graphs of Constant TreewidthShaohua Li, Marcin Pilipczuk. [doi]
• A Polynomial Kernel for Deletion to Ptolemaic GraphsAkanksha Agrawal, Aditya Anand, Saket Saurabh 0001. [doi]
• PACE Solver Description: ADE-SolverAlexander Bille, Dominik Brandenstein, Emanuel Herrendorf. [doi]
• An Investigation of the Recoverable Robust Assignment ProblemDennis Fischer 0001, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger. [doi]
• Twin-Width Is Linear in the Poset WidthJakub Balabán, Petr Hlinený. [doi]
• A Polynomial Kernel for Bipartite Permutation Vertex DeletionLawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma. [doi]
• CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. [doi]
• Twin-Width and Polynomial KernelsÉdouard Bonnet, Eun Jung Kim 0002, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant. [doi]
• A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex CoverJúlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau. [doi]
• Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-WidthGuillaume Ducoffe . [doi]
• PACE Solver Description: The KaPoCE Exact Cluster Editing AlgorithmThomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm. [doi]
• Long Paths Make Pattern-Counting Hard, and Deep Trees Make It HarderVít Jelínek, Michal Opler, Jakub Pekárek. [doi]