Table of Contents

• PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set ProblemSylwester Swat. [doi]
• Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)Dániel Marx, Govind S. Sankar, Philipp Schepper. [doi]
• Domination and Cut Problems on Chordal Graphs with Bounded LeafageEsther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale. [doi]
• PACE Solver Description: DreyFVSGabriel Bathie, Gaétan Berthe, Yoann Coudert-Osmont, David Desobry, Amadeus Reinald, Mathis Rocton. [doi]
• Obstructions to Faster Diameter Computation: Asteroidal SetsGuillaume Ducoffe . [doi]
• Computing Generalized Convolutions Faster Than Brute ForceBaris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki. [doi]
• The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex SetErnestine Großmann, Tobias Heuer, Christian Schulz 0003, Darren Strash. [doi]
• A Fixed-Parameter Algorithm for the Schrijver ProblemIshay Haviv. [doi]
• Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial TimeHjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand. [doi]
• Vertex Cover and Feedback Vertex Set Above and Below Structural GuaranteesLeon Kellerhals, Tomohiro Koana, Pascal Kunz. [doi]
• PACE Solver Description: GraPA-JAVAMoritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, Sebastian Siebertz. [doi]
• PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex SetSebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich 0001, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt 0002, Leo Wendt. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• A Finite Algorithm for the Realizabilty of a Delaunay TriangulationAkanksha Agrawal, Saket Saurabh 0001, Meirav Zehavi. [doi]
• On Sparse Hitting Sets: From Fair Vertex Cover to Highway DimensionJohannes Blum 0001, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta 0002, Anna Zych-Pawlewicz. [doi]
• PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set ProblemYuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv. [doi]
• Exact Exponential Algorithms for Clustering ProblemsFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Nidhi Purohit, Saket Saurabh 0001. [doi]
• Parameterized Complexity of a Parallel Machine Scheduling ProblemMaher Mallem, Claire Hanen, Alix Munier Kordon. [doi]
• FPT Approximation for Fair Minimum-Load ClusteringSayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov. [doi]
• PACE Solver Description: DAGer - Cutting out Cycles with MaxSATRafael Kiesel, André Schidler. [doi]
• Parameterized Complexity of Perfectly Matched SetsAkanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu. [doi]
• XNLP-Completeness for Parameterized Problems on Graphs with a Linear StructureHans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima. [doi]
• On the Parameterized Complexity of Symmetric Directed MulticutEduard Eiben, Clément Rambaud, Magnus Wahlström. [doi]
• On the Parameterized Complexity of Computing Tree-PartitionsHans L. Bodlaender, Carla Groenland, Hugo Jacob. [doi]
• Towards Exact Structural Thresholds for Parameterized ComplexityFalko Hegerfeld, Stefan Kratsch. [doi]
• Hardness of Interval Scheduling on Unrelated MachinesDanny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay. [doi]
• Slim Tree-Cut WidthRobert Ganian, Viktoriia Korchemna. [doi]
• Parameterized Complexity of Maximum Happy Set and Densest k-SubgraphYosuke Mizutani, Blair D. Sullivan. [doi]
• On the Hardness of Generalized Domination Problems Parameterized by Mim-WidthBrage I. K. Bakkane, Lars Jaffke. [doi]
• On the Complexity of Problems on Tree-Structured GraphsHans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk. [doi]
• Twin-Width VIII: Delineation and Win-WinsÉdouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim 0002, Noleen Köhler, Raul Lopes 0001, Stéphan Thomassé. [doi]
• Parameterized Local Search for Vertex Cover: When Only the Search Radius Is CrucialChristian Komusiewicz, Nils Morawietz. [doi]
• Parameterized Complexity of Streaming Diameter and Connectivity ProblemsJelle J. Oostveen, Erik Jan van Leeuwen. [doi]