{"id":"https://openalex.org/W1981591809","doi":"https://doi.org/10.1145/2500119","title":"Finding small separators in linear time via treewidth reduction","display_name":"Finding small separators in linear time via treewidth reduction","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W1981591809","doi":"https://doi.org/10.1145/2500119","mag":"1981591809"},"language":"en","primary_location":{"id":"doi:10.1145/2500119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500119","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/A5035927713","display_name":"D\u00e1aniel Marx","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1aniel Marx","raw_affiliation_strings":["Hungarian Academy of Sciences (MTA SZTAKI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hungarian Academy of Sciences (MTA SZTAKI)","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I4210117195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033998859","display_name":"Barry O\u2019Sullivan","orcid":"https://orcid.org/0000-0002-0090-2085"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Barry O'sullivan","raw_affiliation_strings":["University College Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068912124","display_name":"Igor Razgon","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Igor Razgon","raw_affiliation_strings":["University of Leicester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.4035,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.99425306,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9961000084877014,"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.9857000112533569,"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/combinatorics","display_name":"Combinatorics","score":0.7856349945068359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7242130637168884},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7234214544296265},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.701492428779602},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6008895635604858},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5648679733276367},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5141654014587402},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5043681859970093},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49889612197875977},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4612957239151001},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4490620493888855},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2028210163116455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1737235188484192},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10281810164451599}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7856349945068359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7242130637168884},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7234214544296265},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.701492428779602},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6008895635604858},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5648679733276367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5141654014587402},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5043681859970093},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49889612197875977},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4612957239151001},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4490620493888855},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2028210163116455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1737235188484192},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10281810164451599},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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.1145/2500119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500119","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.6172","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.6172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bme.hu/%7Edmarx/papers/marx-tw-reduction-talg.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3029516847","display_name":null,"funder_award_id":"10/IN.1/13032","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"},{"id":"https://openalex.org/G3756769902","display_name":null,"funder_award_id":"NK105 645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"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":73,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W43334377","https://openalex.org/W132145278","https://openalex.org/W179383408","https://openalex.org/W1485150579","https://openalex.org/W1486674860","https://openalex.org/W1504895562","https://openalex.org/W1507920302","https://openalex.org/W1517036688","https://openalex.org/W1535551556","https://openalex.org/W1556076538","https://openalex.org/W1570425181","https://openalex.org/W1584371244","https://openalex.org/W1593947471","https://openalex.org/W1604791202","https://openalex.org/W1621031363","https://openalex.org/W1627842967","https://openalex.org/W1680695549","https://openalex.org/W1689320375","https://openalex.org/W1832761474","https://openalex.org/W1913947078","https://openalex.org/W1964064059","https://openalex.org/W1985875030","https://openalex.org/W1986011439","https://openalex.org/W1988205260","https://openalex.org/W1994788283","https://openalex.org/W1996668544","https://openalex.org/W2004181701","https://openalex.org/W2005309613","https://openalex.org/W2011911122","https://openalex.org/W2012931553","https://openalex.org/W2013164124","https://openalex.org/W2014735387","https://openalex.org/W2014767497","https://openalex.org/W2016590962","https://openalex.org/W2025304499","https://openalex.org/W2032692205","https://openalex.org/W2033470072","https://openalex.org/W2045326192","https://openalex.org/W2046999257","https://openalex.org/W2048068744","https://openalex.org/W2051856222","https://openalex.org/W2059401572","https://openalex.org/W2077575555","https://openalex.org/W2082223143","https://openalex.org/W2094909623","https://openalex.org/W2106515361","https://openalex.org/W2106959995","https://openalex.org/W2107080175","https://openalex.org/W2111720465","https://openalex.org/W2112018378","https://openalex.org/W2112022679","https://openalex.org/W2121641644","https://openalex.org/W2127890825","https://openalex.org/W2144050783","https://openalex.org/W2146959334","https://openalex.org/W2153724959","https://openalex.org/W2157295389","https://openalex.org/W2161286454","https://openalex.org/W2163101585","https://openalex.org/W2180411372","https://openalex.org/W2489198132","https://openalex.org/W2748837517","https://openalex.org/W2913688336","https://openalex.org/W2914959486","https://openalex.org/W2964011138","https://openalex.org/W3022717963","https://openalex.org/W3101793140","https://openalex.org/W4210556995","https://openalex.org/W4213048784","https://openalex.org/W4234163381","https://openalex.org/W4252125530","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2075531723","https://openalex.org/W2113684989","https://openalex.org/W2945561475","https://openalex.org/W4285659194","https://openalex.org/W4389814085","https://openalex.org/W4300943255","https://openalex.org/W3048010228","https://openalex.org/W3031065515","https://openalex.org/W1487038674","https://openalex.org/W2953390393"],"abstract_inverted_index":{"We":[0,181],"present":[1],"a":[2,9,23,60,134],"method":[3],"for":[4,66,78,123,153,206],"reducing":[5],"the":[6,47,52,88,140,176,185,188],"treewidth":[7],"of":[8,14,71,96,106,128,136,142,175,187,191],"graph":[10,53],"while":[11],"preserving":[12],"all":[13],"its":[15],"minimal":[16],"s":[17,35],"-":[18,36],"t":[19,37],"separators":[20],"up":[21],"to":[22,33,115,150],"certain":[24],"fixed":[25,68,125,208],"size":[26],"k":[27,70,111,127],".":[28],"This":[29],"technique":[30,147],"allows":[31],"us":[32],"solve":[34,102],"Cut":[38],"and":[39,161],"Multicut":[40],"problems":[41,79,167,193],"with":[42],"various":[43],"additional":[44],"restrictions":[45],"(e.g.,":[46],"vertices":[48,112],"being":[49],"removed":[50,72,129],"from":[51,113],"form":[54],"an":[55],"independent":[56],"set":[57],"or":[58],"induce":[59],"connected":[61],"graph)":[62],"in":[63,119,139,184,202],"linear":[64,121,204],"time":[65,122,205],"every":[67,124,207],"number":[69,126,135],"vertices.":[73,130],"Our":[74],"results":[75,132],"have":[76],"applications":[77],"that":[80,198],"are":[81,171],"not":[82],"directly":[83],"defined":[84],"by":[85,194],"separators,":[86],"but":[87],"known":[89],"solution":[90],"methods":[91],"depend":[92],"on":[93],"some":[94],"variant":[95],"separation.":[97],"For":[98],"example,":[99],"we":[100],"can":[101,199],"similarly":[103],"restricted":[104],"generalizations":[105],"Bipartization":[107],"(delete":[108],"at":[109],"most":[110],"G":[114],"make":[116,182],"it":[117],"bipartite)":[118],"almost":[120,203],"These":[131],"answer":[133],"open":[137],"questions":[138],"area":[141],"parameterized":[143,189],"complexity.":[144],"Furthermore,":[145],"our":[146],"turns":[148],"out":[149],"be":[151,200],"relevant":[152],"(":[154,162],"H":[155,163,178],",":[156,158,164],"C":[157,165],"K":[159],")-":[160],",\u2264K)-coloring":[166],"as":[168],"well,":[169],"which":[170],"cardinality":[172,209],"constrained":[173],"variants":[174],"classical":[177],"-coloring":[179],"problem.":[180],"progress":[183],"classification":[186],"complexity":[190],"these":[192],"identifying":[195],"new":[196],"cases":[197],"solved":[201],"bound.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}