{"id":"https://openalex.org/W2146232473","doi":"https://doi.org/10.3233/fi-2013-800","title":"Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width","display_name":"Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2146232473","doi":"https://doi.org/10.3233/fi-2013-800","mag":"2146232473"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2013-800","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-800","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090886391","display_name":"Petr Hlin\u011bn\u00fd","orcid":"https://orcid.org/0000-0003-2125-1514"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Hlin\u011bn\u00fd","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048869948","display_name":"Jan \u00d3bdr\u017e\u00e1lek","orcid":"https://orcid.org/0000-0002-6655-7798"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Obdr\u017e\u00e1lek","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic. {ganian, hlineny, obdrzalek}@fi.muni.cz","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088116512"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":3.6254,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.93292804,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"123","issue":"1","first_page":"59","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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.9973000288009644,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7282244563102722},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7158662676811218},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6629484295845032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5666431784629822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5422095060348511},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5244374871253967},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5030602812767029},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48434770107269287},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4663592576980591},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4407736659049988},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4110547602176666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38439232110977173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31117087602615356},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06369635462760925}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7282244563102722},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7158662676811218},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6629484295845032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5666431784629822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5422095060348511},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5244374871253967},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5030602812767029},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48434770107269287},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4663592576980591},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4407736659049988},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4110547602176666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38439232110977173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31117087602615356},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06369635462760925},{"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.3233/fi-2013-800","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-800","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1540966565","https://openalex.org/W1558213091","https://openalex.org/W1574058191","https://openalex.org/W1784874204","https://openalex.org/W1977262817","https://openalex.org/W2006912660","https://openalex.org/W2011632049","https://openalex.org/W2019578639","https://openalex.org/W2034183528","https://openalex.org/W2053991811","https://openalex.org/W2063951771","https://openalex.org/W2087911394","https://openalex.org/W2090518395","https://openalex.org/W2101101966","https://openalex.org/W2140285470","https://openalex.org/W2148185803","https://openalex.org/W2165880875","https://openalex.org/W2170114629","https://openalex.org/W2171507355","https://openalex.org/W2287549241","https://openalex.org/W2396556839","https://openalex.org/W2588904535","https://openalex.org/W2950414403","https://openalex.org/W2984546510","https://openalex.org/W3137355438"],"related_works":["https://openalex.org/W1865369187","https://openalex.org/W2997249752","https://openalex.org/W2523981875","https://openalex.org/W2327631927","https://openalex.org/W2093568763","https://openalex.org/W1985166372","https://openalex.org/W2003096546","https://openalex.org/W2430210575","https://openalex.org/W4289354592","https://openalex.org/W2165069859"],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2,17,28],"parameterized":[3],"algorithm":[4,33],"for":[5],"the":[6,12,21,24],"propositional":[7],"model":[8],"counting":[9],"problem":[10],"#SAT,":[11],"runtime":[13],"of":[14,23,27],"which":[15],"has":[16],"single-exponential":[18],"dependency":[19],"on":[20],"rank-width":[22],"signed":[25],"graph":[26],"formula.":[29],"That":[30],"is,":[31],"our":[32],"runs":[34],"in":[35],"time":[36],"$\\cal{O}(t^3":[37],"\\cdo":[38]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}