Deterministic FPT Algorithms for the Exact Matching Problem and NP-hardness of Related Problems

The exact matching problem can be solved by deterministic FPT algorithms parameterized by the independence number and the minimum size of an odd cycle transversal. The correct parity matching problem, a relaxed variant, is shown to be NP-hard.