---
res:
  bibo_abstract:
  - The main result of this paper is a generalization of the classical blossom algorithm
    for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs
    where each variable appears in exactly two constraints (we call it edge CSP) and
    all constraints are even Δ-matroid relations (represented by lists of tuples).
    As a consequence of this, we settle the complexity classification of planar Boolean
    CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even
    Δ-matroid constraints allows us to extend the tractability result to a larger
    class of Δ-matroids that includes many classes that were known to be tractable
    before, namely co-independent, compact, local and binary.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Alexandr
      foaf_name: Kazda, Alexandr
      foaf_surname: Kazda
      foaf_workInfoHomepage: http://www.librecat.org/personId=3B32BAA8-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Vladimir
      foaf_name: Kolmogorov, Vladimir
      foaf_surname: Kolmogorov
      foaf_workInfoHomepage: http://www.librecat.org/personId=3D50B0BA-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Michal
      foaf_name: Rolinek, Michal
      foaf_surname: Rolinek
      foaf_workInfoHomepage: http://www.librecat.org/personId=3CB3BC06-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.1137/1.9781611974782.20
  dct_date: 2017^xs_gYear
  dct_identifier:
  - UT:000426965800020
  dct_isPartOf:
  - http://id.crossref.org/issn/978-161197478-2
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: Even delta-matroids and the complexity of planar Boolean CSPs@
...