{"id":"https://openalex.org/W1456870675","doi":"https://doi.org/10.1007/s00446-015-0251-x","title":"A distributed low tree-depth decomposition algorithm for bounded expansion classes","display_name":"A distributed low tree-depth decomposition algorithm for bounded expansion classes","publication_year":2015,"publication_date":"2015-09-07","ids":{"openalex":"https://openalex.org/W1456870675","doi":"https://doi.org/10.1007/s00446-015-0251-x","mag":"1456870675"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-015-0251-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-015-0251-x","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"Distributed Computing","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/A5070558406","display_name":"Jaroslav Ne\u0161et\u0159il","orcid":"https://orcid.org/0000-0002-5133-5586"},"institutions":[{"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":["CZ"],"is_corresponding":false,"raw_author_name":"J. Ne\u0161et\u0159il","raw_affiliation_strings":["Computer Science Institute of Charles University (IUUK and ITI), Malostransk\u00e9 n\u00e1m.25, 11800, Praha 1, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University (IUUK and ITI), Malostransk\u00e9 n\u00e1m.25, 11800, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004397700","display_name":"Patrice Ossona de Mendez","orcid":"https://orcid.org/0000-0003-0724-3729"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4210100624","display_name":"Centre d'Analyse et de Math\u00e9matique Sociales","ror":"https://ror.org/00vb8fc53","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210100624","https://openalex.org/I4210150854","https://openalex.org/I90669466"]}],"countries":["CZ","FR"],"is_corresponding":false,"raw_author_name":"P. Ossona de Mendez","raw_affiliation_strings":["Centre d\u2019Analyse et de Math\u00e9matiques Sociales (CNRS, UMR 8557), 190-198 avenue de France, 75013, Paris, France","Computer Science Institute of Charles University (IUUK and ITI), Malostransk\u00e9 n\u00e1m.25, 11800, Praha 1, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-0724-3729","affiliations":[{"raw_affiliation_string":"Centre d\u2019Analyse et de Math\u00e9matiques Sociales (CNRS, UMR 8557), 190-198 avenue de France, 75013, Paris, France","institution_ids":["https://openalex.org/I4210100624","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Computer Science Institute of Charles University (IUUK and ITI), Malostransk\u00e9 n\u00e1m.25, 11800, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":1.4537,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8210675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"29","issue":"1","first_page":"39","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10142","display_name":"Formal Methods in Verification","score":0.9951000213623047,"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.9939000010490417,"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.7880302667617798},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7293723821640015},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5658048391342163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5175958871841431},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.47775450348854065},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4302974343299866},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4233511686325073},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4116976857185364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40862101316452026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4019867181777954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35174521803855896},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.32020634412765503},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29122963547706604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22401735186576843},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07918858528137207}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7880302667617798},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7293723821640015},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5658048391342163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5175958871841431},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.47775450348854065},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4302974343299866},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4233511686325073},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4116976857185364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40862101316452026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4019867181777954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35174521803855896},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.32020634412765503},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29122963547706604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22401735186576843},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07918858528137207},{"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.1007/s00446-015-0251-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-015-0251-x","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"Distributed Computing","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":39,"referenced_works":["https://openalex.org/W394816042","https://openalex.org/W1479059960","https://openalex.org/W1512725763","https://openalex.org/W1523755288","https://openalex.org/W1526652053","https://openalex.org/W1568961751","https://openalex.org/W1684832175","https://openalex.org/W1776842391","https://openalex.org/W1815738779","https://openalex.org/W1978747958","https://openalex.org/W1985598531","https://openalex.org/W2009524061","https://openalex.org/W2018615281","https://openalex.org/W2022155283","https://openalex.org/W2039898566","https://openalex.org/W2045111615","https://openalex.org/W2046857096","https://openalex.org/W2048377505","https://openalex.org/W2052210031","https://openalex.org/W2054910423","https://openalex.org/W2065967498","https://openalex.org/W2068312052","https://openalex.org/W2075921069","https://openalex.org/W2078674325","https://openalex.org/W2092864936","https://openalex.org/W2098564749","https://openalex.org/W2109368894","https://openalex.org/W2112212574","https://openalex.org/W2131735508","https://openalex.org/W2132050408","https://openalex.org/W2136185479","https://openalex.org/W2143305437","https://openalex.org/W2149284317","https://openalex.org/W2149573503","https://openalex.org/W2531503199","https://openalex.org/W3009862127","https://openalex.org/W3032071526","https://openalex.org/W4205300528","https://openalex.org/W4302437703"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2985636744","https://openalex.org/W1485639265","https://openalex.org/W143512583","https://openalex.org/W2962819865","https://openalex.org/W2162616398","https://openalex.org/W1511821218","https://openalex.org/W2113901576","https://openalex.org/W4301463689","https://openalex.org/W2605313623"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}