{"id":"https://openalex.org/W1988642505","doi":"https://doi.org/10.1007/s00453-007-9149-8","title":"Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings","display_name":"Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings","publication_year":2007,"publication_date":"2007-12-13","ids":{"openalex":"https://openalex.org/W1988642505","doi":"https://doi.org/10.1007/s00453-007-9149-8","mag":"1988642505"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9149-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9149-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","Lund University, Department of Computer Science, Box 118, 221 00, Lund, Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund University, Department of Computer Science, Box 118, 221 00, Lund, Sweden#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041727204","display_name":"Thore Husfeldt","orcid":"https://orcid.org/0000-0001-9078-4512"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Thore Husfeldt","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","Lund University, Department of Computer Science, Box 118, 221 00, Lund, Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund University, Department of Computer Science, Box 118, 221 00, Lund, Sweden#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041727204"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":8.6696,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.9803517,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"52","issue":"2","first_page":"226","last_page":"249"},"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/mathematics","display_name":"Mathematics","score":0.7520703077316284},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7271239757537842},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6246493458747864},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5743539333343506},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5565798878669739},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5432175397872925},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5107972621917725},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.47643738985061646},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4605940580368042},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4514235854148865},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4445869028568268},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4286385774612427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32089197635650635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3144790828227997},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.20530444383621216}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7520703077316284},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7271239757537842},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6246493458747864},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5743539333343506},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5565798878669739},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5432175397872925},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5107972621917725},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.47643738985061646},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4605940580368042},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4514235854148865},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4445869028568268},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4286385774612427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32089197635650635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3144790828227997},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.20530444383621216},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-007-9149-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9149-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:c9b512bf-d79f-40b5-b1e9-ce1ad5ab422e","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1249695","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0178-4617","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/bae46cc0-e3de-11dd-a259-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/bae46cc0-e3de-11dd-a259-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bj\u00f6rklund, A & Husfeldt, T 2008, 'Exact algorithms for exact satisfiability and number of perfect matchings', Algorithmica, vol. 52, no. 2, pp. 226-249. https://doi.org/10.1007/s00453-007-9149-8","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W140158205","https://openalex.org/W1489932425","https://openalex.org/W1544675895","https://openalex.org/W1571792361","https://openalex.org/W1582963151","https://openalex.org/W1593916827","https://openalex.org/W1602078796","https://openalex.org/W1975286948","https://openalex.org/W1975587904","https://openalex.org/W1979740015","https://openalex.org/W1982027240","https://openalex.org/W1982174487","https://openalex.org/W2001868457","https://openalex.org/W2006912660","https://openalex.org/W2007200873","https://openalex.org/W2012041962","https://openalex.org/W2012473793","https://openalex.org/W2013568176","https://openalex.org/W2030227772","https://openalex.org/W2034758366","https://openalex.org/W2035645338","https://openalex.org/W2057361103","https://openalex.org/W2060123147","https://openalex.org/W2074359677","https://openalex.org/W2084732238","https://openalex.org/W2089328544","https://openalex.org/W2089417393","https://openalex.org/W2104739701","https://openalex.org/W2107351840","https://openalex.org/W2122639972","https://openalex.org/W2124240997","https://openalex.org/W2127390687","https://openalex.org/W2133732980","https://openalex.org/W2163938320","https://openalex.org/W2170702810","https://openalex.org/W2244726603","https://openalex.org/W2913688336","https://openalex.org/W4243285511","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1970590090","https://openalex.org/W2100782222","https://openalex.org/W2115404728","https://openalex.org/W52360167","https://openalex.org/W1985572324","https://openalex.org/W2461588548","https://openalex.org/W2030227772","https://openalex.org/W4388329052","https://openalex.org/W2395270758","https://openalex.org/W2952626310"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}