{"id":"https://openalex.org/W7131463912","doi":"https://doi.org/10.4230/lipics.stacs.2026.78","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-01","ids":{"openalex":"https://openalex.org/W7131463912","doi":"https://doi.org/10.4230/lipics.stacs.2026.78"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25567","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.78","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.78/LIPIcs.STACS.2026.78.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.78/LIPIcs.STACS.2026.78.pdf","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":[{"id":"https://openalex.org/I4210104335","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210104335"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sharma, Roohani","raw_affiliation_strings":["Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea","institution_ids":["https://openalex.org/I4210104335"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139616","display_name":"Micha\u0142 W\u0142odarczyk","orcid":"https://orcid.org/0000-0003-0968-8414"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"W\u0142odarczyk, Micha\u0142","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042086477"],"corresponding_institution_ids":["https://openalex.org/I4210104335"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54582577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.5231999754905701,"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.5231999754905701,"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.4230000078678131,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.007499999832361937,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9016000032424927},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.542900025844574},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4828999936580658},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"Polynomial kernel","score":0.4702000021934509},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42289999127388},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.3894999921321869},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3718000054359436},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3580999970436096}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9016000032424927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7921000123023987},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6987000107765198},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.542900025844574},{"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.4828999936580658},{"id":"https://openalex.org/C160446489","wikidata":"https://www.wikidata.org/wiki/Q7226642","display_name":"Polynomial kernel","level":4,"score":0.4702000021934509},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42289999127388},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3549000024795532},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.35249999165534973},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3481999933719635},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.33239999413490295},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.3240000009536743},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.2687000036239624},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25567","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.78","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.78/LIPIcs.STACS.2026.78.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"doi:10.4230/lipics.stacs.2026.78","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2026.78","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25567","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.78","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.78/LIPIcs.STACS.2026.78.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320326441","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131463912.pdf","grobid_xml":"https://content.openalex.org/works/W7131463912.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"\u2131":[1,79,103,223,248,258,314,328],"be":[2,45,110,117,149,183,260,330],"a":[3,15,34,48,70,81,94,155,161,169,193,209,225,281,293,316,354],"finite":[4],"family":[5,41,78],"of":[6,51,87,107,136,154,205,247],"graphs.":[7],"In":[8,58,140],"the":[9,23,40,77,85,100,105,133,137,152,179,216,320,335],"\u2131-Deletion":[10],"problem,":[11],"one":[12],"is":[13,25,90,129,235],"given":[14],"graph":[16,35,311,350],"G":[17],"and":[18,22,54,249],"an":[19,200,231],"integer":[20],"k,":[21],"goal":[24],"to":[26,116,187,199,219,289,297,329],"find":[27],"k":[28,108],"vertices":[29],"whose":[30],"deletion":[31],"results":[32,218,263],"in":[33,104,212,257,327],"with":[36,168,196,295],"no":[37],"minor":[38],"from":[39],"\u2131.":[42],"This":[43],"may":[44,259],"regarded":[46],"as":[47,228,230],"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,345],"Saurabh":[66,123],"[FOCS":[67],"2012]":[68],"gave":[69],"polynomial":[71,211],"kernel":[72,89,170],"for":[73,132,166,192,233,237],"this":[74,128,141,146],"problem":[75],"when":[76,254,313],"contains":[80,224,315],"planar":[82,226,317],"graph.":[83],"As":[84],"size":[86,171,206],"g(\u2131)":[91],"\u22c5":[92,173],"k^{f(\u2131)},":[93],"natural":[95],"follow-up":[96],"question":[97],"was":[98],"whether":[99],"dependence":[101],"on":[102,265,309,349],"exponent":[106],"can":[109,148,182],"avoided.":[111],"The":[112],"answer":[113],"turned":[114],"out":[115],"negative:":[118],"Giannopoulou,":[119],"Jansen,":[120],"Lokshtanov":[121],"[TALG":[124,347],"2017]":[125],"proved":[126],"that":[127,145,178,202,352],"already":[130],"inevitable":[131],"special":[134],"case":[135],"Treewidth-\u03b7-Deletion":[138,167,234],"problem.":[139],"we":[143,159,176,190,270,286,304,333],"show":[144,177,287],"non-uniformity":[147],"avoided":[150],"at":[151],"expense":[153],"small":[156,238,282],"loss.":[157,284],"First,":[158,269],"present":[160],"simple":[162],"2-approximate":[163],"kernelization":[164,194,336],"algorithm":[165,337],"g(\u03b7)":[172],"k\u2076.":[174],"Next,":[175],"approximation":[180],"factor":[181],"made":[184],"arbitrarily":[185],"close":[186],"1,":[188],"if":[189],"settle":[191],"protocol":[195],"\ud835\udcaa(1)":[197],"calls":[198],"oracle":[201,232],"solves":[203],"instances":[204],"bounded":[207],"by":[208,279,338],"uniform":[210],"k.":[213],"We":[214],"extend":[215],"above":[217],"general":[220,298],"\u2131-Deletion,":[221],"whenever":[222],"graph,":[227,318],"long":[229],"available":[236],"instances.":[239],"Notably,":[240],"all":[241,325],"our":[242,250,301],"constants":[243],"are":[244],"computable":[245],"functions":[246],"techniques":[251],"work":[252],"also":[253,305],"some":[255],"graphs":[256,326],"disconnected.":[261],"Our":[262],"rely":[264],"two":[266],"novel":[267],"techniques.":[268],"transform":[271],"so-called":[272],"\"near-protrusion":[273],"decompositions\"":[274],"into":[275],"true":[276],"protrusion":[277],"decompositions":[278],"sacrificing":[280],"accuracy":[283],"Secondly,":[285],"how":[288],"optimally":[290],"compress":[291],"such":[292],"decomposition":[294],"respect":[296],"\u2131-Deletion.":[299],"Using":[300],"second":[302],"technique,":[303],"obtain":[306],"linear":[307],"kernels":[308],"sparse":[310],"classes":[312,351],"whereas":[319],"previously":[321],"known":[322],"theorems":[323],"required":[324],"connected.":[331],"Specifically,":[332],"generalize":[334],"Kim,":[339],"Langer,":[340],"Paul,":[341],"Reidl,":[342],"Rossmanith,":[343],"Sau":[344],"Sikdar":[346],"2015]":[348],"exclude":[353],"topological":[355],"minor.":[356]},"counts_by_year":[],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2026-02-26T00:00:00"}