Parameterization of (Partial) Maximum Satisfiability Above Matching in a Variable-Clause Graph

Published in AAAI, 2024

We study Maximum Satisfiability and Partial Maximum Satisfiability parameterized above matching in the variable-clause graph, improving earlier running-time bounds.

Recommended citation: Vasily Alferov, Ivan Bliznets, and Kirill Brilliantov. "Parameterization of (Partial) Maximum Satisfiability Above Matching in a Variable-Clause Graph." AAAI, 2024.