{"id":"https://openalex.org/W2086937160","doi":"https://doi.org/10.1007/s00453-007-9130-6","title":"An Improved Parameterized Algorithm for\u00a0the\u00a0Minimum Node Multiway Cut Problem","display_name":"An Improved Parameterized Algorithm for\u00a0the\u00a0Minimum Node Multiway Cut Problem","publication_year":2007,"publication_date":"2007-11-20","ids":{"openalex":"https://openalex.org/W2086937160","doi":"https://doi.org/10.1007/s00453-007-9130-6","mag":"2086937160"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9130-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9130-6","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/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100356203","display_name":"Yang Liu","orcid":"https://orcid.org/0000-0003-4994-5200"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Liu","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011246709","display_name":"Songjian Lu","orcid":"https://orcid.org/0000-0002-6976-9294"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Songjian Lu","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, Department of Computer Science, 77843, College Station, TX, USA#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.4919,"has_fulltext":false,"cited_by_count":131,"citation_normalized_percentile":{"value":0.94541441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"55","issue":"1","first_page":"1","last_page":"13"},"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.9952999949455261,"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.9952999949455261,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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.9916999936103821,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8073911070823669},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6709402203559875},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6366578340530396},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6214206218719482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5337494611740112},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5294228196144104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5233530402183533},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49730947613716125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4850012958049774},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44700175523757935},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4408380687236786},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4366067945957184},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42060214281082153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3362923264503479}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8073911070823669},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6709402203559875},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6366578340530396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6214206218719482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5337494611740112},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5294228196144104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5233530402183533},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49730947613716125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4850012958049774},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44700175523757935},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4408380687236786},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4366067945957184},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42060214281082153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3362923264503479},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-007-9130-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9130-6","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1981960292","https://openalex.org/W1996169001","https://openalex.org/W2016590962","https://openalex.org/W2022841964","https://openalex.org/W2025896589","https://openalex.org/W2054396313","https://openalex.org/W2096139825","https://openalex.org/W2099237065","https://openalex.org/W2121641644","https://openalex.org/W2152986618","https://openalex.org/W2159454021","https://openalex.org/W2168505046","https://openalex.org/W2405419040","https://openalex.org/W2913688336","https://openalex.org/W3009415557","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1986447712","https://openalex.org/W2110193191","https://openalex.org/W2492498253","https://openalex.org/W3135299686","https://openalex.org/W2136838521","https://openalex.org/W4206498635","https://openalex.org/W2951185106","https://openalex.org/W2113270940","https://openalex.org/W2126169066","https://openalex.org/W2983359005"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}