2026-07-26T17:24:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19454 2024-03-06T11:04:06Z ddc:004 open_access

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth Bannach, Max Berndt, Sebastian Twinwidth Algorithm Engineering FPT Kernelization This article is a report by the challenge organizers on the 8th Parameterized Algorithms and Computational Experiments Challenge (PACE 2023). As was common in previous iterations of the competition, this year’s iteration implemented an exact and heuristic track for a parameterized problem that has gained attention in the theory community. This year, the problem was to compute the twinwidth of a graph, a recently introduced width parameter that measures the similarity of a graph to a cograph. In the exact track, the competition participants were asked to develop an exact algorithm that can solve as many instances as possible from a benchmark set of 100 instances - with a time limit of 30 minutes per instance. The same task must be accomplished within 5 minutes in the heuristic track. However, the result in this track is not required to be optimal. As in previous iterations, the organizers handed out awards to the best solutions in both tracks and to the best student submissions. New this year is a dedicated theory award that appreciates new theoretical insights found by the participants during the development of their tools. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Max Bannach and Sebastian Berndt 2023 Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2023.35 urn:nbn:de:0030-drops-194548 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.35 eng https://creativecommons.org/licenses/by/4.0/legalcode