{"id":"https://openalex.org/W4416296752","doi":"https://doi.org/10.1145/3776738","title":"Planar Multiway Cut with Terminals on Few Faces","display_name":"Planar Multiway Cut with Terminals on Few Faces","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4416296752","doi":"https://doi.org/10.1145/3776738"},"language":"en","primary_location":{"id":"doi:10.1145/3776738","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3776738","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5039235742","display_name":"Sukanya Pandey","orcid":"https://orcid.org/0000-0001-5728-1120"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sukanya Pandey","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Aachen, Germany","Dept. Computer Science, RWTH Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5728-1120","affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Dept. Computer Science, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erik Jan van Leeuwen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands","Dept. Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-5240-7257","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Dept. Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53996394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"2","first_page":"1","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.22579999268054962,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.22579999268054962,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.1736000031232834,"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.16990000009536743,"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.694100022315979},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6643999814987183},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6204000115394592},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5892999768257141},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5315999984741211},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5077999830245972},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4880000054836273},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.445499986410141},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.42419999837875366}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.694100022315979},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6643999814987183},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6204000115394592},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5892999768257141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5483999848365784},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5077999830245972},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4796999990940094},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4345000088214874},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.42419999837875366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42239999771118164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4074999988079071},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3982999920845032},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.3384999930858612},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.26330000162124634},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.25699999928474426},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3776738","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3776738","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":33,"referenced_works":["https://openalex.org/W1974901680","https://openalex.org/W1987374783","https://openalex.org/W1989626562","https://openalex.org/W1991579759","https://openalex.org/W1993974115","https://openalex.org/W1996668544","https://openalex.org/W2005309613","https://openalex.org/W2018165282","https://openalex.org/W2019137761","https://openalex.org/W2025304499","https://openalex.org/W2031493401","https://openalex.org/W2037455685","https://openalex.org/W2038643780","https://openalex.org/W2040444410","https://openalex.org/W2065759448","https://openalex.org/W2068595367","https://openalex.org/W2084806590","https://openalex.org/W2086937160","https://openalex.org/W2092029376","https://openalex.org/W2118966355","https://openalex.org/W2121641644","https://openalex.org/W2147929948","https://openalex.org/W2152986618","https://openalex.org/W2165142526","https://openalex.org/W2565287168","https://openalex.org/W2568986002","https://openalex.org/W2964006350","https://openalex.org/W2977258053","https://openalex.org/W2999762092","https://openalex.org/W3000473895","https://openalex.org/W3009415557","https://openalex.org/W3205741188","https://openalex.org/W4213060883"],"related_works":[],"abstract_inverted_index":{"We":[0,116],"consider":[1],"the":[2,30,40,48,56,65],"Edge":[3,91],"Multiway":[4,92],"Cut":[5,93],"problem":[6],"on":[7,108],"planar":[8,57,109],"graphs.":[9],"It":[10],"is":[11,39,47],"known":[12],"that":[13,59,90],"this":[14,88],"can":[15,94],"be":[16,95],"solved":[17,96],"in":[18,26,87,97],"\\(n^{{O}(\\sqrt{t})}\\)":[19],"time":[20,28,72,99],"(Klein":[21],"and":[22,24,113],"Marx)":[23],"not":[25],"\\(n^{o(\\sqrt{t})}\\)":[27],"under":[29],"Exponential":[31],"Time":[32],"Hypothesis":[33],"(Marx),":[34],"where":[35],"\\(":[36,50],"t":[37],"\\)":[38,52],"number":[41,49],"of":[42,53,55,136],"terminals.":[43,63,137],"A":[44],"stronger":[45],"parameter":[46],"k":[51],"faces":[54],"graph":[58],"jointly":[60],"cover":[61],"all":[62],"For":[64],"related":[66],"Steiner":[67],"Tree":[68],"problem,":[69],"an":[70],"\\(n^{{O}(\\sqrt{k})}\\)":[71,98],"algorithm":[73],"was":[74],"recently":[75],"shown":[76],"(Kisfaludi-Bak":[77],"et":[78],"al.).":[79],"By":[80],"a":[81,119,125],"completely":[82],"different":[83],"approach,":[84],"we":[85],"prove":[86],"article":[89],"as":[100],"well.":[101],"Our":[102],"approach":[103],"employs":[104],"several":[105],"major":[106],"concepts":[107],"graphs,":[110],"including":[111],"homotopy":[112],"sphere-cut":[114],"decomposition.":[115],"also":[117],"mix":[118],"global":[120],"treewidth":[121],"dynamic":[122,128],"program":[123,129],"with":[124,133],"Dreyfus-Wagner":[126],"style":[127],"to":[130],"locally":[131],"deal":[132],"large":[134],"numbers":[135]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}