{"id":"https://openalex.org/W4214759105","doi":"https://doi.org/10.1007/s10703-021-00373-5","title":"Faster algorithms for quantitative verification in bounded treewidth graphs","display_name":"Faster algorithms for quantitative verification in bounded treewidth graphs","publication_year":2021,"publication_date":"2021-04-29","ids":{"openalex":"https://openalex.org/W4214759105","doi":"https://doi.org/10.1007/s10703-021-00373-5"},"language":"en","primary_location":{"id":"doi:10.1007/s10703-021-00373-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10703-021-00373-5","pdf_url":null,"source":{"id":"https://openalex.org/S3845260","display_name":"Formal Methods in System Design","issn_l":"0925-9856","issn":["0925-9856","1572-8102"],"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":"Formal Methods in System Design","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/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"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":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Am Campus 1, 3400, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Am Campus 1, 3400, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072999400","display_name":"Rasmus Ibsen-Jensen","orcid":"https://orcid.org/0000-0003-4783-0389"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rasmus Ibsen-Jensen","raw_affiliation_strings":["University of Liverpool, Liverpool, L69 3BX, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, L69 3BX, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["Aarhus University, Aabogade 34, 8200, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aabogade 34, 8200, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022252401"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2690,"currency":"EUR","value_usd":3490},"apc_paid":null,"fwci":0.3014,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64496151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":"3","first_page":"401","last_page":"428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.9979000091552734,"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/treewidth","display_name":"Treewidth","score":0.9264107942581177},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.680980920791626},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6804961562156677},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5022916793823242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47820544242858887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45553067326545715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3794264495372772},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35468757152557373},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34011223912239075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3306896686553955},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.27746152877807617},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2680066227912903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.264425128698349},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.053306370973587036}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9264107942581177},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.680980920791626},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6804961562156677},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5022916793823242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47820544242858887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45553067326545715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3794264495372772},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35468757152557373},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34011223912239075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3306896686553955},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.27746152877807617},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2680066227912903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.264425128698349},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.053306370973587036},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10703-021-00373-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10703-021-00373-5","pdf_url":null,"source":{"id":"https://openalex.org/S3845260","display_name":"Formal Methods in System Design","issn_l":"0925-9856","issn":["0925-9856","1572-8102"],"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":"Formal Methods in System Design","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/13c6bb39-780f-4a29-8d17-ead6162a30d7","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/13c6bb39-780f-4a29-8d17-ead6162a30d7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chatterjee, K, Ibsen-Jensen, R & Pavlogiannis, A 2021, 'Faster algorithms for quantitative verification in bounded treewidth graphs', Formal Methods in System Design, vol. 57, no. 3, pp. 401-428. https://doi.org/10.1007/s10703-021-00373-5","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2532958243","display_name":null,"funder_award_id":"279307","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G4004637531","display_name":null,"funder_award_id":"Faculty Fellows Award","funder_id":"https://openalex.org/F4320307764","funder_display_name":"Microsoft"},{"id":"https://openalex.org/G683671635","display_name":null,"funder_award_id":"S11407-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8326495921","display_name":null,"funder_award_id":"P23499-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320307764","display_name":"Microsoft","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W29365316","https://openalex.org/W43626140","https://openalex.org/W854382448","https://openalex.org/W1541012495","https://openalex.org/W1569998753","https://openalex.org/W1584965098","https://openalex.org/W1602042964","https://openalex.org/W1643571618","https://openalex.org/W1818617877","https://openalex.org/W1829133288","https://openalex.org/W1852784691","https://openalex.org/W1975294133","https://openalex.org/W1981797649","https://openalex.org/W1989556004","https://openalex.org/W1990480988","https://openalex.org/W2002722727","https://openalex.org/W2008440715","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2036772106","https://openalex.org/W2036801474","https://openalex.org/W2048881187","https://openalex.org/W2072929390","https://openalex.org/W2074131210","https://openalex.org/W2081806129","https://openalex.org/W2090010485","https://openalex.org/W2102159907","https://openalex.org/W2118382442","https://openalex.org/W2119468705","https://openalex.org/W2125690626","https://openalex.org/W2126766880","https://openalex.org/W2133749858","https://openalex.org/W2133853963","https://openalex.org/W2146709340","https://openalex.org/W2158185919","https://openalex.org/W2162150822","https://openalex.org/W2168601854","https://openalex.org/W2294334272","https://openalex.org/W2914617426","https://openalex.org/W2949740838","https://openalex.org/W3005566493","https://openalex.org/W3027560063","https://openalex.org/W4256129064"],"related_works":["https://openalex.org/W1976784955","https://openalex.org/W2012687409","https://openalex.org/W2889180046","https://openalex.org/W2091382007","https://openalex.org/W1976463682","https://openalex.org/W2029854525","https://openalex.org/W4297435153","https://openalex.org/W1585579706","https://openalex.org/W2742781497","https://openalex.org/W2803227791"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}