Belaïd Benhamou. Satisfiability and matchings in bipartite graphs: relationship and tractability.
The journal of Spanish Royal Academy of sciences (RACSAM), a special issu on Symbolic Computation and Artificial Intelligence, 2004, 98 ((1--2)), pp.55 - 63.
⟨hal-01479584⟩