PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem.

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. 2012 ACM Subject Classification Theory of computation -> Parameterized complexity and exact algorithms