{"id":"https://openalex.org/W7124146494","doi":"https://doi.org/10.48550/arxiv.2601.08424","title":"Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors","display_name":"Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors","publication_year":2026,"publication_date":"2026-01-13","ids":{"openalex":"https://openalex.org/W7124146494","doi":"https://doi.org/10.48550/arxiv.2601.08424"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.stacs.2026.78","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042086477","display_name":"Roohani Sharma","orcid":"https://orcid.org/0000-0003-2212-1359"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sharma, Roohani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139616","display_name":"Micha\u0142 W\u0142odarczyk","orcid":"https://orcid.org/0000-0003-0968-8414"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W\u0142odarczyk, Micha\u0142","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042086477"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.5058000087738037,"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.5058000087738037,"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.4327999949455261,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.009200000204145908,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/kernelization","display_name":"Kernelization","score":0.9327999949455261},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5529000163078308},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44600000977516174},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"Polynomial kernel","score":0.4429999887943268},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4142000079154968},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4047999978065491},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4000999927520752},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.38089999556541443},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3682999908924103}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9327999949455261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7864000201225281},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7657999992370605},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5529000163078308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5324000120162964},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C160446489","wikidata":"https://www.wikidata.org/wiki/Q7226642","display_name":"Polynomial kernel","level":4,"score":0.4429999887943268},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4142000079154968},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4047999978065491},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4000999927520752},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3682999908924103},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3612000048160553},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.313400000333786},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.30559998750686646},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2750000059604645},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.stacs.2026.78","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2601.08424","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.08424","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.stacs.2026.78","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"F":[1,79,103,223,237],"be":[2,45,110,117,149,182,239],"a":[3,15,34,48,70,81,94,155,161,192,208,225,263],"finite":[4],"family":[5,41,78],"of":[6,51,87,107,136,154,204],"graphs.":[7],"In":[8,58,140],"the":[9,23,40,77,85,100,105,133,137,152,178,229,244],"F-Deletion":[10],"problem,":[11],"one":[12],"is":[13,25,90,129],"given":[14],"graph":[16,35,220,259],"G":[17],"and":[18,22,54],"an":[19,199],"integer":[20],"k,":[21],"goal":[24],"to":[26,116,186,198,238],"find":[27],"k":[28,108],"vertices":[29],"whose":[30],"deletion":[31],"results":[32],"in":[33,104,211,236],"with":[36,168,195],"no":[37],"minor":[38],"from":[39],"F.":[42],"This":[43],"may":[44],"regarded":[46],"as":[47],"far-reaching":[49],"generalization":[50],"Vertex":[52],"Cover":[53],"Feedback":[55],"vertex":[56],"Set.":[57],"their":[59,88],"seminal":[60],"work,":[61,142],"Fomin,":[62],"Lokshtanov,":[63],"Misra":[64],"&":[65,122,254],"Saurabh":[66,123],"[FOCS":[67],"2012]":[68],"gave":[69],"polynomial":[71,210],"kernel":[72,89,169],"for":[73,132,166,191],"this":[74,128,141,146],"problem":[75],"when":[76,222],"contains":[80,224],"planar":[82,226],"graph.":[83],"As":[84],"size":[86,170,205],"g(F)":[91],"*":[92,172],"k^{f(F)},":[93],"natural":[95],"follow-up":[96],"question":[97],"was":[98],"whether":[99],"dependence":[101],"on":[102,218,258],"exponent":[106],"can":[109,148,181],"avoided.":[111],"The":[112],"answer":[113],"turned":[114],"out":[115],"negative:":[118],"Giannapoulou,":[119],"Jansen,":[120],"Lokshtanov":[121],"[TALG":[124,256],"2017]":[125],"proved":[126],"that":[127,145,177,201,261],"already":[130],"inevitable":[131],"special":[134],"case":[135],"Treewidth-d-Deletion":[138,167],"problem.":[139],"we":[143,159,175,189,242],"show":[144,176],"non-uniformity":[147],"avoided":[150],"at":[151],"expense":[153],"small":[156],"loss.":[157],"First,":[158],"present":[160],"simple":[162],"2-approximate":[163],"kernelization":[164,193,245],"algorithm":[165,246],"g(d)":[171],"k^5.":[173],"Next,":[174],"approximation":[179],"factor":[180],"made":[183],"arbitrarily":[184],"close":[185],"1,":[187],"if":[188],"settle":[190],"protocol":[194],"O(1)":[196],"calls":[197],"oracle":[200],"solves":[202],"instances":[203],"bounded":[206],"by":[207,247],"uniform":[209],"k.":[212],"We":[213],"also":[214],"obtain":[215],"linear":[216],"kernels":[217],"sparse":[219],"classes":[221,260],"graph,":[227],"whereas":[228],"previously":[230],"known":[231],"theorems":[232],"required":[233],"all":[234],"graphs":[235],"connected.":[240],"Specifically,":[241],"generalize":[243],"Kim,":[248],"Langer,":[249],"Paul,":[250],"Reidl,":[251],"Rossmanith,":[252],"Sau":[253],"Sikdar":[255],"2015]":[257],"exclude":[262],"topological":[264],"minor.":[265]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-01-15T00:00:00"}