{"id":"https://openalex.org/W3160089363","doi":"https://doi.org/10.1145/3274652","title":"Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes","display_name":"Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes","publication_year":2018,"publication_date":"2018-11-16","ids":{"openalex":"https://openalex.org/W3160089363","doi":"https://doi.org/10.1145/3274652","mag":"3160089363"},"language":"en","primary_location":{"id":"doi:10.1145/3274652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274652","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/A5062011497","display_name":"Stephan Kreutzer","orcid":"https://orcid.org/0009-0002-9409-5356"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stephan Kreutzer","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073512540","display_name":"Roman Rabinovich","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Rabinovich","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073548944","display_name":"Sebastian Siebertz","orcid":"https://orcid.org/0000-0002-6347-1198"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Siebertz","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062011497"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.31505255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"19"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nowhere-dense-set","display_name":"Nowhere dense set","score":0.7930791974067688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7456580400466919},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6964607834815979},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5442672967910767},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5410744547843933},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5304652452468872},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5086406469345093},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"Polynomial kernel","score":0.4730345904827118},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46759268641471863},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4182773232460022},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41664573550224304},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3182099461555481},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.30180662870407104},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.18273794651031494},{"id":"https://openalex.org/keywords/kernel-method","display_name":"Kernel method","score":0.17733052372932434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1233140230178833}],"concepts":[{"id":"https://openalex.org/C17327563","wikidata":"https://www.wikidata.org/wiki/Q1991405","display_name":"Nowhere dense set","level":3,"score":0.7930791974067688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7456580400466919},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6964607834815979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5442672967910767},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5410744547843933},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5304652452468872},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5086406469345093},{"id":"https://openalex.org/C160446489","wikidata":"https://www.wikidata.org/wiki/Q7226642","display_name":"Polynomial kernel","level":4,"score":0.4730345904827118},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46759268641471863},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4182773232460022},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41664573550224304},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3182099461555481},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30180662870407104},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.18273794651031494},{"id":"https://openalex.org/C122280245","wikidata":"https://www.wikidata.org/wiki/Q620622","display_name":"Kernel method","level":3,"score":0.17733052372932434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1233140230178833},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3274652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274652","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1971361630","https://openalex.org/W1971790772","https://openalex.org/W1978747958","https://openalex.org/W1980240005","https://openalex.org/W1994264784","https://openalex.org/W1996668544","https://openalex.org/W2005659848","https://openalex.org/W2020913456","https://openalex.org/W2035409201","https://openalex.org/W2037713618","https://openalex.org/W2039898566","https://openalex.org/W2075921069","https://openalex.org/W2076594341","https://openalex.org/W2093762675","https://openalex.org/W2098564749","https://openalex.org/W2099898495","https://openalex.org/W3121437753","https://openalex.org/W4245461353","https://openalex.org/W4253175698","https://openalex.org/W6831323056"],"related_works":["https://openalex.org/W2241818993","https://openalex.org/W2105793991","https://openalex.org/W2139428469","https://openalex.org/W2952271241","https://openalex.org/W1606810574","https://openalex.org/W2963329454","https://openalex.org/W2514937286","https://openalex.org/W3160089363","https://openalex.org/W2936634590","https://openalex.org/W4298239121"],"abstract_inverted_index":{"Nowhere":[0],"dense":[1,57,196],"classes":[2,10,28,197],"of":[3,11,26,31,66,81,94,107,121,157,165,198,213,235,250,256],"graphs":[4,14,214],"[21,":[5],"22]":[6],"are":[7],"very":[8],"general":[9],"uniformly":[12],"sparse":[13],"with":[15],"several":[16],"seemingly":[17],"unrelated":[18],"characterisations.":[19],"From":[20],"an":[21],"algorithmic":[22],"perspective,":[23],"a":[24,35,73,90,105,137,141,155,184,228,244],"characterisation":[25],"these":[27],"in":[29,38,52,77,87,102,130,140,151,160],"terms":[30],"uniform":[32,70,125],"quasi-wideness":[33,49,71],",":[34],"concept":[36],"originating":[37],"finite":[39],"model":[40,108],"theory,":[41,113],"has":[42],"proved":[43],"to":[44,114,135,146,154,175],"be":[45],"particularly":[46,203],"useful.":[47],"Uniform":[48],"is":[50,134,202,216],"used":[51],"many":[53],"fpt-algorithms":[54],"on":[55,194,230],"nowhere":[56,67,122,195],"classes.":[58],"However,":[59],"the":[60,64,78,82,119,148,161,166,188,221,253],"existing":[61],"constructions":[62],"showing":[63],"equivalence":[65,120],"denseness":[68,123],"and":[69,124,238],"imply":[72],"non-elementary":[74],"blow":[75],"up":[76],"parameter":[79,162],"dependence":[80],"fpt-algorithms,":[83],"making":[84],"them":[85],"infeasible":[86],"practice.":[88],"As":[89],"first":[91],"main":[92],"result":[93,201],"this":[95],"article,":[96],"we":[97],"use":[98],"tools":[99,172],"from":[100,104],"logic,":[101],"particular":[103],"sub-field":[106],"theory":[109,133,259],"known":[110],"as":[111,205],"stability":[112],"establish":[115],"polynomial":[116,152,185,245],"bounds":[117],"for":[118,177,187,209,232,247],"quasi-wideness.":[126],"A":[127],"powerful":[128],"method":[129],"parameterized":[131,257],"complexity":[132,258],"compute":[136],"problem":[138,193,226],"kernel":[139,186,229,246],"pre-computation":[142],"step,":[143],"that":[144,208,215,260],"is,":[145],"reduce":[147],"input":[149,167],"instance":[150],"time":[153],"sub-instance":[156],"size":[158],"bounded":[159],"only":[163,239],"(independently":[164],"graph":[168],"size).":[169],"Our":[170],"new":[171],"allow":[173],"us":[174],"obtain":[176],"every":[178,210,233,248],"fixed":[179],"radius":[180],"r":[181,190,223,236,251],"\u2208":[182],"N":[183],"distance-":[189,222],"dominating":[191,224],"set":[192,225],"graphs.":[199],"This":[200],"interesting,":[204],"it":[206,241],"implies":[207],"class":[211],"C":[212,231],"closed":[217],"under":[218],"taking":[219],"subgraphs,":[220],"admits":[227,243],"value":[234,249],"if,":[237,240],"already":[242],"(under":[252],"standard":[254],"assumption":[255],"FPT":[261],"\u2260":[262],"W[2]).":[263]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}