2026-07-21T20:02:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25165 2026-02-09T08:18:06Z ddc:004 open_access

PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem Dirks, Jona Gerhard, Enna Kaial, Victoria Lorieau, Lucas complexity theory parameterized complexity linear programming java dominating set PACE 2025 We present and describe the solver OBLX for the Dominating Set problem on graphs. This solver was developed during the PACE challenge 2025 for the Exact track. It first applies several data reduction rules and performs a polynomial time reduction to Max Sat. The resulting Max Sat instance is in turn solved using the EvalMaxSat solver by Florent Avellaneda. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jona Dirks and Enna Gerhard and Victoria Kaial and Lucas Lorieau 2025 Is Part Of LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2025.33 urn:nbn:de:0030-drops-251659 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.33 eng https://creativecommons.org/licenses/by/4.0/legalcode