{"id":"https://openalex.org/W3098486139","doi":"https://doi.org/10.1137/1.9781611973099.6","title":"Kernelization of Packing Problems","display_name":"Kernelization of Packing Problems","publication_year":2012,"publication_date":"2012-01-17","ids":{"openalex":"https://openalex.org/W3098486139","doi":"https://doi.org/10.1137/1.9781611973099.6","mag":"3098486139"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973099.6","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.6","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1812.03155","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052689442","display_name":"Holger Dell","orcid":"https://orcid.org/0000-0001-8955-0786"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Holger Dell","raw_affiliation_strings":["Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"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\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"68","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9530189037322998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7800617814064026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7176047563552856},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6671186685562134},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6332705020904541},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5980373620986938},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5325528383255005},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5273507237434387},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5254330039024353},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5129477381706238},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4959329068660736},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.4880038797855377},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.47725436091423035},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.46608230471611023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4623175263404846},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.42536699771881104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3423183560371399},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11835071444511414},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09109184145927429}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9530189037322998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7800617814064026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7176047563552856},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6671186685562134},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6332705020904541},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5980373620986938},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5325528383255005},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5273507237434387},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5254330039024353},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5129477381706238},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4959329068660736},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.4880038797855377},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.47725436091423035},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.46608230471611023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4623175263404846},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.42536699771881104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3423183560371399},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11835071444511414},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09109184145927429},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611973099.6","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.6","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1812.03155","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.03155","pdf_url":"https://arxiv.org/pdf/1812.03155","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1812.03155","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.03155","pdf_url":"https://arxiv.org/pdf/1812.03155","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W130689240","https://openalex.org/W184144034","https://openalex.org/W1487173148","https://openalex.org/W1519122062","https://openalex.org/W1558630420","https://openalex.org/W1964699377","https://openalex.org/W1974810008","https://openalex.org/W1976430052","https://openalex.org/W1998552318","https://openalex.org/W1998964055","https://openalex.org/W1999681430","https://openalex.org/W2001191566","https://openalex.org/W2016341899","https://openalex.org/W2034377062","https://openalex.org/W2034437384","https://openalex.org/W2039100365","https://openalex.org/W2045501273","https://openalex.org/W2051064851","https://openalex.org/W2051784313","https://openalex.org/W2052712469","https://openalex.org/W2061881283","https://openalex.org/W2075339720","https://openalex.org/W2107284348","https://openalex.org/W2140430392","https://openalex.org/W2152550583","https://openalex.org/W2174049388","https://openalex.org/W2177196747","https://openalex.org/W2253657605","https://openalex.org/W2490706771","https://openalex.org/W2563156040","https://openalex.org/W2797447161","https://openalex.org/W2914414140","https://openalex.org/W4211210842","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2886237949","https://openalex.org/W4289276807","https://openalex.org/W2952288771","https://openalex.org/W4301321172","https://openalex.org/W2545198300","https://openalex.org/W1667353902","https://openalex.org/W292557428","https://openalex.org/W2289764920","https://openalex.org/W3098486139","https://openalex.org/W2140699162"],"abstract_inverted_index":{"Kernelization":[0],"algorithms":[1],"are":[2,116],"polynomial-time":[3],"reductions":[4],"from":[5,251],"a":[6,16,36,44,72,143,230,243,252],"problem":[7,33,153,198,244,256],"to":[8,14,142,168,268,276],"itself":[9],"that":[10,89,187,219,233,257],"guarantee":[11],"their":[12],"output":[13],"have":[15,124],"size":[17,39,81,160,240],"not":[18,92,123,210],"exceeding":[19],"some":[20],"bound.":[21],"For":[22],"example,":[23],"d-Set":[24,108,119],"Matching":[25,109],"for":[26,74,82,104,118,129,151,170,196,242],"integers":[27],"d":[28,161],"\u2265":[29],"3":[30],"is":[31,91,166,258],"the":[32,79,86,97,105,135,152,174,197,213,269,278],"of":[34,38,107,145,154,159,177,199,204,217,224,239],"finding":[35,155,200],"matching":[37],"at":[40],"least":[41],"k":[42,156,201],"in":[43,94,162,186,245],"given":[45],"d-uniform":[46,246],"hypergraph":[47],"and":[48,61,66,110,283],"has":[49],"kernels":[50,125,192,238],"with":[51,126,193,288],"O(kd)":[52],"edges.":[53],"Recently,":[54],"Bodlaender":[55],"et":[56],"al.":[57],"[ICALP":[58],"2008],":[59,64],"Fortnow":[60],"Santhanam":[62],"[STOC":[63,69,286],"Dell":[65,282],"Van":[67,284],"Melkebeek":[68,285],"2010]":[70,287],"developed":[71],"framework":[73],"proving":[75],"lower":[76,102,215,226],"bounds":[77,103,115,172],"on":[78,173],"kernel":[80,175],"certain":[83],"problems,":[84],"under":[85],"complexity-theoretic":[87],"hypothesis":[88,136],"coNP":[90],"contained":[93],"NP/poly.":[95],"Under":[96],"same":[98],"hypothesis,":[99],"we":[100,220,234,264],"show":[101],"kernelization":[106],"other":[111],"packing":[112,180],"problems.":[113,181],"Our":[114],"tight":[117,171],"Matching:":[120],"It":[121,165],"does":[122,209],"O(kd\u2212\u220a)":[127,241],"edges":[128,195,206],"any":[130],"\u220a":[131],">":[132],"0":[133],"unless":[134],"fails.":[137],"By":[138],"reduction,":[139],"this":[140,266],"transfers":[141],"bound":[144,216,227],"O(kd":[146],"\u2212":[147,149],"1":[148],"\u220a)":[150],"vertex-disjoint":[157,202],"cliques":[158],"standard":[163],"graphs.":[164],"natural":[167],"ask":[169],"sizes":[176],"such":[178],"graph":[179],"We":[182],"make":[183],"first":[184],"progress":[185],"direction":[188],"by":[189,281],"showing":[190],"non-trivial":[191],"O(k2.5)":[194],"paths":[203],"three":[205],"each.":[207],"This":[208],"quite":[211],"match":[212],"best":[214],"O(k2\u2212\u220a)":[218],"can":[221],"prove.":[222],"Most":[223],"our":[225],"proofs":[228],"follow":[229],"general":[231],"scheme":[232,267],"discover:":[235],"To":[236],"exclude":[237],"hypergraphs,":[247],"one":[248],"should":[249],"reduce":[250],"carefully":[253],"chosen":[254],"d-partite":[255],"still":[259],"NP-hard.":[260],"As":[261],"an":[262],"illustration,":[263],"apply":[265],"vertex":[270],"cover":[271],"problem,":[272],"which":[273],"allows":[274],"us":[275],"replace":[277],"number-theoretical":[279],"construction":[280],"shorter":[289],"elementary":[290],"arguments.":[291]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}