{"id":"https://openalex.org/W4416250416","doi":"https://doi.org/10.1007/s00453-025-01343-7","title":"Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs","display_name":"Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs","publication_year":2025,"publication_date":"2025-11-15","ids":{"openalex":"https://openalex.org/W4416250416","doi":"https://doi.org/10.1007/s00453-025-01343-7"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01343-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-025-01343-7","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/A5045385502","display_name":"Felicia Lucke","orcid":"https://orcid.org/0000-0002-9860-2928"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Felicia Lucke","raw_affiliation_strings":["LIP, ENS Lyon, Lyon, France"],"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105757829","display_name":"Ali Momeni","orcid":"https://orcid.org/0009-0009-8280-7847"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ali Momeni","raw_affiliation_strings":["Faculty of Computer Science, UniVie Doctoral School Computer Science DoCS,  University of Vienna, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, UniVie Doctoral School Computer Science DoCS,  University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003084202","display_name":"Siani Smith","orcid":"https://orcid.org/0000-0003-0797-0512"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Siani Smith","raw_affiliation_strings":["Department of Computer Science,  Loughborough University, Loughborough, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  Loughborough University, Loughborough, UK","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045385502"],"corresponding_institution_ids":["https://openalex.org/I113428412"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36219885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.40709999203681946,"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.40709999203681946,"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.4034000039100647,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.04360000044107437,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8192999958992004},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5084999799728394},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.46709999442100525},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4399000108242035},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42399999499320984},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41429999470710754},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3562999963760376}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8192999958992004},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7861999869346619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7160000205039978},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5178999900817871},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5084999799728394},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.46709999442100525},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4399000108242035},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3562999963760376},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.298799991607666},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2782999873161316},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.27720001339912415},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.26570001244544983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-025-01343-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-025-01343-7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1924888395","https://openalex.org/W1986824573","https://openalex.org/W1997541985","https://openalex.org/W2003292013","https://openalex.org/W2046680668","https://openalex.org/W2056827961","https://openalex.org/W2082548475","https://openalex.org/W2173904855","https://openalex.org/W2738197751","https://openalex.org/W2798321768","https://openalex.org/W2987461903","https://openalex.org/W3110459966","https://openalex.org/W3120847125","https://openalex.org/W3131349932","https://openalex.org/W3179053635","https://openalex.org/W3184379502","https://openalex.org/W4250524283","https://openalex.org/W4282919382","https://openalex.org/W4296666778","https://openalex.org/W4379796487","https://openalex.org/W4399803587","https://openalex.org/W4401741726","https://openalex.org/W4403171189","https://openalex.org/W4404910855","https://openalex.org/W4406651651","https://openalex.org/W4410207421"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-28T09:20:10.287259","created_date":"2025-10-10T00:00:00"}