{"id":"https://openalex.org/W2948240252","doi":"https://doi.org/10.1145/3319909","title":"Split Contraction","display_name":"Split Contraction","publication_year":2019,"publication_date":"2019-05-31","ids":{"openalex":"https://openalex.org/W2948240252","doi":"https://doi.org/10.1145/3319909","mag":"2948240252"},"language":"en","primary_location":{"id":"doi:10.1145/3319909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319909","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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/A5029431771","display_name":"Akanksha Agrawal","orcid":"https://orcid.org/0000-0002-0656-7572"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Akanksha Agrawal","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Computer Science, University of California Santa Barbara, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["The Institute of Mathematical Science, HBNI, India and Department of Informatics, University of Bergen, Norway and UMI ReLax"],"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Science, HBNI, India and Department of Informatics, University of Bergen, Norway and UMI ReLax","institution_ids":["https://openalex.org/I59611059","https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meirav Zehavi","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029431771"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.776,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74039868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9958000183105469,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"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.7466561794281006},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7430199980735779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6151905655860901},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6092733144760132},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5906362533569336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5243711471557617},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5184966325759888},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4886196255683899},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45488834381103516}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7466561794281006},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7430199980735779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6151905655860901},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6092733144760132},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5906362533569336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5243711471557617},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5184966325759888},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4886196255683899},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45488834381103516},{"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.1145/3319909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319909","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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":48,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W78635179","https://openalex.org/W281935416","https://openalex.org/W1428780104","https://openalex.org/W1517036688","https://openalex.org/W1561738351","https://openalex.org/W1570425181","https://openalex.org/W1832264756","https://openalex.org/W1985427743","https://openalex.org/W1995725694","https://openalex.org/W2003744153","https://openalex.org/W2006468321","https://openalex.org/W2012067448","https://openalex.org/W2022137727","https://openalex.org/W2048845385","https://openalex.org/W2051627428","https://openalex.org/W2059451253","https://openalex.org/W2061513598","https://openalex.org/W2061881283","https://openalex.org/W2062347470","https://openalex.org/W2065067474","https://openalex.org/W2065161629","https://openalex.org/W2084286057","https://openalex.org/W2116087731","https://openalex.org/W2141235933","https://openalex.org/W2143474538","https://openalex.org/W2144050783","https://openalex.org/W2156785727","https://openalex.org/W2165648442","https://openalex.org/W2174231092","https://openalex.org/W2234496216","https://openalex.org/W2243582562","https://openalex.org/W2286480406","https://openalex.org/W2479413759","https://openalex.org/W2496893526","https://openalex.org/W2550548770","https://openalex.org/W2570366614","https://openalex.org/W2748096547","https://openalex.org/W2803460775","https://openalex.org/W2953335934","https://openalex.org/W2962874115","https://openalex.org/W2963260267","https://openalex.org/W2964157158","https://openalex.org/W2997728797","https://openalex.org/W3000706835","https://openalex.org/W3022542130","https://openalex.org/W4210334774","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W41549461","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4286853492","https://openalex.org/W4296116869","https://openalex.org/W3215145351"],"abstract_inverted_index":{"The":[0],"edit":[1],"operation":[2,10],"that":[3,88,127,142,199],"contracts":[4],"edges,":[5],"which":[6,45],"is":[7,52,92,107,132,152,187,203,213],"a":[8,65,93],"fundamental":[9],"in":[11,46,116,175],"the":[12,24,40,47,108,158,164,188,193,207,214,220,234,239,252],"theory":[13],"of":[14,26,37,42,49,192,209,219,238,254,263],"graph":[15,66,95,109],"minors,":[16],"has":[17],"recently":[18],"gained":[19],"substantial":[20],"scientific":[21],"attention":[22],"from":[23,111,257],"viewpoint":[25],"Parameterized":[27],"Complexity.":[28],"In":[29,242],"this":[30,200,212,248],"article,":[31],"we":[32],"examine":[33],"an":[34,69],"important":[35],"family":[36,41],"graphs,":[38,44],"namely,":[39],"split":[43,94],"context":[48],"edge":[50],"contractions":[51],"proven":[53],"to":[54,246],"be":[55,173,262],"significantly":[56],"less":[57],"obedient":[58],"than":[59],"one":[60],"might":[61,261],"expect.":[62],"Formally,":[63],"given":[64],"G":[67,85,89,104,112],"and":[68,96,120,260],"integer":[70],"k":[71,101],",":[72,147],"S":[73,128,143,168],"PLIT":[74,129,144,169],"C":[75,130,145,170],"ONTRACTION":[76,131,146,171],"asks":[77],"whether":[78],"there":[79],"exists":[80],"X":[81,91,98,106,117],"\u2286":[82],"E":[83],"(":[84],")":[86],"such":[87],"/":[90,105],"|":[97,99],"\u2264":[100],".":[102,118],"Here,":[103],"obtained":[110],"by":[113,233],"contracting":[114],"edges":[115],"Guo":[119],"Cai":[121],"[Theoretical":[122],"Computer":[123],"Science,":[124],"2015]":[125],"claimed":[126],"fixed-parameter":[133],"tractable.":[134],"However,":[135],"our":[136,210,244],"findings":[137],"are":[138],"different.":[139],"We":[140,196],"show":[141],"despite":[148],"its":[149],"deceptive":[150],"simplicity,":[151],"W[1]-hard.":[153],"Our":[154],"main":[155],"result":[156],"establishes":[157],"following":[159],"conditional":[160],"lower":[161,201,217,249],"bound:":[162],"Under":[163],"Exponential":[165],"Time":[166],"Hypothesis,":[167],"cannot":[172],"solved":[174],"time":[176],"2":[177,180,222,225],"o":[178,223],"(\u2113":[179,224],")\u22c5":[181,226],"n":[182,227],"O":[183,228],"(1),":[184],"where":[185],"\u2113":[186],"vertex":[189,235],"cover":[190,236],"number":[191,237],"input":[194,240],"graph.":[195,241],"also":[197],"verify":[198],"bound":[202,218,250],"essentially":[204],"tight.":[205],"To":[206],"best":[208],"knowledge,":[211],"first":[215],"tight":[216],"form":[221],"(1)":[229],"for":[230],"problems":[231],"parameterized":[232],"particular,":[243],"approach":[245],"obtain":[247],"borrows":[251],"notion":[253],"harmonious":[255],"coloring":[256],"Graph":[258],"Theory,":[259],"independent":[264],"interest.":[265]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2019-06-14T00:00:00"}