{"id":"https://openalex.org/W191485599","doi":"https://doi.org/10.1007/978-3-642-29828-8_11","title":"Constraint Optimization Problems and Bounded Tree-Width Revisited","display_name":"Constraint Optimization Problems and Bounded Tree-Width Revisited","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W191485599","doi":"https://doi.org/10.1007/978-3-642-29828-8_11","mag":"191485599"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-29828-8_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29828-8_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5025217588","display_name":"Tommy F\u00e4rnqvist","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Tommy F\u00e4rnqvist","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden","Department of Computer and Information Science, Link\u00f6ping University, LINK\u00d6PING, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, LINK\u00d6PING, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025217588"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4151,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88230394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"163","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9404000043869019,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6859815120697021},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6410109996795654},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.6245118379592896},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5835310816764832},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5488267540931702},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.524506688117981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5011050701141357},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4901023805141449},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4728843569755554},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.4708409309387207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46291831135749817},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46235713362693787},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4577843248844147},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.4474775195121765},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.434222549200058},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.4122503101825714},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39198583364486694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3677378296852112},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3412947654724121},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.31476470828056335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26527461409568787},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.2139509618282318},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12554556131362915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.104246586561203}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6859815120697021},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6410109996795654},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.6245118379592896},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5835310816764832},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5488267540931702},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.524506688117981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5011050701141357},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4901023805141449},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4728843569755554},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4708409309387207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46291831135749817},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46235713362693787},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4577843248844147},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.4474775195121765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.434222549200058},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.4122503101825714},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39198583364486694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3677378296852112},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3412947654724121},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.31476470828056335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26527461409568787},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.2139509618282318},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12554556131362915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.104246586561203},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-29828-8_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29828-8_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W52840101","https://openalex.org/W103975088","https://openalex.org/W1507841763","https://openalex.org/W1558184472","https://openalex.org/W1570425181","https://openalex.org/W1589421353","https://openalex.org/W1872146596","https://openalex.org/W1885547793","https://openalex.org/W1983022219","https://openalex.org/W1983648207","https://openalex.org/W1999038767","https://openalex.org/W2022841964","https://openalex.org/W2033325972","https://openalex.org/W2046527740","https://openalex.org/W2057256946","https://openalex.org/W2061513598","https://openalex.org/W2066776015","https://openalex.org/W2067706177","https://openalex.org/W2080192364","https://openalex.org/W2104498537","https://openalex.org/W2104967659","https://openalex.org/W2111829945","https://openalex.org/W2127045103","https://openalex.org/W2146492010","https://openalex.org/W2148417962","https://openalex.org/W2150132485","https://openalex.org/W2150339067","https://openalex.org/W2151617868","https://openalex.org/W2153629319","https://openalex.org/W2155683758","https://openalex.org/W2157827214","https://openalex.org/W2159738186","https://openalex.org/W2295958421","https://openalex.org/W2337098149","https://openalex.org/W2497660909","https://openalex.org/W2569549435","https://openalex.org/W2952861917","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1768378007","https://openalex.org/W1983648207","https://openalex.org/W1820477541","https://openalex.org/W4239133097","https://openalex.org/W1519282274","https://openalex.org/W1770162292","https://openalex.org/W2675278944","https://openalex.org/W1957191361","https://openalex.org/W1486916474","https://openalex.org/W2032348095"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}