{"id":"https://openalex.org/W2904289608","doi":"https://doi.org/10.1145/3230649","title":"Even Delta-Matroids and the Complexity of Planar Boolean CSPs","display_name":"Even Delta-Matroids and the Complexity of Planar Boolean CSPs","publication_year":2018,"publication_date":"2018-12-07","ids":{"openalex":"https://openalex.org/W2904289608","doi":"https://doi.org/10.1145/3230649","mag":"2904289608"},"language":"en","primary_location":{"id":"doi:10.1145/3230649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3230649","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046084833","display_name":"Alexandr Kazda","orcid":"https://orcid.org/0000-0002-7338-037X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["AT","CZ"],"is_corresponding":true,"raw_author_name":"Alexandr Kazda","raw_affiliation_strings":["IST Austria and Charles University, Praha, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-7338-037X","affiliations":[{"raw_affiliation_string":"IST Austria and Charles University, Praha, Czech Republic","institution_ids":["https://openalex.org/I157556583","https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021390142","display_name":"Vladimir Kolmogorov","orcid":"https://orcid.org/0000-0002-7625-8986"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Vladimir Kolmogorov","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056307421","display_name":"Michal Rol\u00ednek","orcid":null},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]},{"id":"https://openalex.org/I4210135521","display_name":"Max Planck Institute for Intelligent Systems","ror":"https://ror.org/04fq9j139","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210135521"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Michal Rol\u00ednek","raw_affiliation_strings":["IST Austria and Max Planck Institute for Intelligent Systems, T\u00fcbingen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria and Max Planck Institute for Intelligent Systems, T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I4210135521","https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046084833"],"corresponding_institution_ids":["https://openalex.org/I157556583","https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.2149,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58941441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9214868545532227},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.7612935304641724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5833431482315063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5502901673316956},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5138504505157471},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5001490116119385},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4944157600402832},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.482638418674469},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.42665958404541016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34683358669281006},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09529033303260803}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9214868545532227},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7612935304641724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5833431482315063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5502901673316956},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5138504505157471},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5001490116119385},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4944157600402832},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.482638418674469},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.42665958404541016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34683358669281006},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09529033303260803},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3230649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3230649","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1978185401","https://openalex.org/W1987374783","https://openalex.org/W1991963660","https://openalex.org/W1997649256","https://openalex.org/W2003722559","https://openalex.org/W2004222819","https://openalex.org/W2032487621","https://openalex.org/W2034959769","https://openalex.org/W2043040255","https://openalex.org/W2043193943","https://openalex.org/W2066894529","https://openalex.org/W2133839024","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2252896066","https://openalex.org/W2334820307","https://openalex.org/W2561675875","https://openalex.org/W2962785950","https://openalex.org/W2963768895","https://openalex.org/W4230416342","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2058489697","https://openalex.org/W2106412416","https://openalex.org/W4367050287","https://openalex.org/W2046319394","https://openalex.org/W146649319","https://openalex.org/W2072414647","https://openalex.org/W2550106438","https://openalex.org/W2494200571","https://openalex.org/W2409819057","https://openalex.org/W4298343133"],"abstract_inverted_index":{"The":[0],"main":[1],"result":[2,80,148],"of":[3,9,48,53,60,84,124],"this":[4],"article":[5],"is":[6,149],"a":[7,51,70,131],"generalization":[8],"the":[10,57,78,116,127,154],"classical":[11],"blossom":[12],"algorithm":[13,19,156],"for":[14,157],"finding":[15],"perfect":[16],"matchings.":[17],"Our":[18],"can":[20,141],"efficiently":[21,89],"solve":[22],"Boolean":[23,62],"CSPs":[24,63],"where":[25],"each":[26],"variable":[27],"appears":[28],"in":[29],"exactly":[30],"two":[31,129],"constraints":[32,40],"(we":[33],"call":[34,88],"it":[35],"edge":[36],"CSP)":[37],"and":[38,67,112,159],"all":[39],"are":[41],"even":[42,73],"\u0394-matroid":[43],"relations":[44],"(represented":[45],"by":[46,65,122,133],"lists":[47,123],"tuples).":[49],"As":[50],"consequence":[52],"this,":[54],"we":[55,75,87],"settle":[56],"complexity":[58],"classification":[59],"planar":[61],"started":[64],"Dvo\u0159\u00e1k":[66],"Kupec.":[68],"Using":[69],"reduction":[71],"to":[72,81,99],"\u0394-matroids,":[74],"then":[76],"extend":[77],"tractability":[79,147],"larger":[82],"classes":[83,95],"\u0394-matroids":[85,121],"that":[86,96],"coverable":[90],".":[91],"It":[92],"properly":[93],"includes":[94],"were":[97],"known":[98,155],"be":[100],"tractable":[101],"before,":[102],"namely,":[103],"co-independent":[104],",":[105,107,109,111,114],"compact":[106],"local":[108],"linear":[110,158],"binary":[113,160],"with":[115],"following":[117],"caveat:":[118],"We":[119],"represent":[120,142],"tuples,":[125,145],"while":[126],"last":[128],"use":[130],"representation":[132],"matrices.":[134],"Since":[135],"an":[136],"n":[137,139],"\u00d7":[138],"matrix":[140],"exponentially":[143],"many":[144],"our":[146],"not":[150],"strictly":[151],"stronger":[152],"than":[153],"\u0394-matroids.":[161]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}