{"id":"https://openalex.org/W2950782844","doi":"https://doi.org/10.4230/lipics.stacs.2011.165","title":"Cross-Composition: A New Technique for Kernelization Lower Bounds","display_name":"Cross-Composition: A New Technique for Kernelization Lower Bounds","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2950782844","doi":"https://doi.org/10.4230/lipics.stacs.2011.165","mag":"2950782844"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:3008","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.165","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol009-stacs2011/LIPIcs.STACS.2011.165/LIPIcs.STACS.2011.165.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W6891605351","display_name":"LIPIcs, Volume 9, STACS'11, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W2950782844","https://openalex.org/W6891605351"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol009-stacs2011/LIPIcs.STACS.2011.165/LIPIcs.STACS.2011.165.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330","observed_orcids":["https://orcid.org/0000-0002-9297-3330"]},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bodlaender, Hans L.","raw_affiliation_strings":["Department of Information and Computing Sciences [Utrecht]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences [Utrecht]","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268","observed_orcids":["https://orcid.org/0000-0001-8204-1268"]},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jansen, Bart M. P.","raw_affiliation_strings":["Department of Information and Computing Sciences [Utrecht]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences [Utrecht]","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050140825","display_name":"Stefan Kratsch","orcid":"https://orcid.org/0000-0002-0193-7239","observed_orcids":["https://orcid.org/0000-0002-0193-7239"]},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Kratsch, Stefan","raw_affiliation_strings":["Department of Information and Computing Sciences [Utrecht]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences [Utrecht]","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":19.5176,"has_fulltext":true,"cited_by_count":104,"citation_normalized_percentile":{"value":0.99779935,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":100},"biblio":{"volume":"9","issue":null,"first_page":"165","last_page":"176"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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.0007999999797903001,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"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/kernelization-lower-bounds","display_name":"kernelization lower bounds","score":0.9869999885559082},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"polynomial kernel","score":0.906000018119812},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.8960000276565552},{"id":"https://openalex.org/keywords/polynomial-hierarchy-collapse","display_name":"polynomial hierarchy collapse","score":0.8709999918937683},{"id":"https://openalex.org/keywords/chromatic-number","display_name":"chromatic number","score":0.8790000081062317},{"id":"https://openalex.org/keywords/clique-problem","display_name":"clique problem","score":0.9599999785423279},{"id":"https://openalex.org/keywords/vertex-cover-number","display_name":"vertex cover number","score":0.7450000047683716},{"id":"https://openalex.org/keywords/structural-parameterization","display_name":"structural parameterization","score":0.6809999942779541},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.8569999933242798}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9771854877471924},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.792161226272583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6953907608985901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6698675751686096},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6192691326141357},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5428417325019836},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5409442186355591},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.529060959815979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46310728788375854},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.43652892112731934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38610321283340454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33904415369033813},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:3008","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.165","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol009-stacs2011/LIPIcs.STACS.2011.165/LIPIcs.STACS.2011.165.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:884413","doi":null,"is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=884413","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:HAL:hal-00573603v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-00573603","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.165-176","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:library.tue.nl:856863","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/856863","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:884413","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/884413","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:library.tue.nl:856863","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/856863","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:884413","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/884413","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.4230/lipics.stacs.2011.165","doi":"https://doi.org/10.4230/lipics.stacs.2011.165","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2011.165","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.601.428","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.601.428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://subs.emis.de/LIPIcs/volltexte/2011/3008/pdf/18_.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:3008","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.165","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol009-stacs2011/LIPIcs.STACS.2011.165/LIPIcs.STACS.2011.165.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G9001327588","display_name":"KERNELS: Complexity and Combinatorial Analysis of Data Reduction","funder_award_id":"612.065.825","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2950782844.pdf","grobid_xml":"https://content.openalex.org/works/W2950782844.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1544829330","https://openalex.org/W1606657688","https://openalex.org/W1826506799","https://openalex.org/W1947666077","https://openalex.org/W1986602165","https://openalex.org/W1996192734","https://openalex.org/W1998964055","https://openalex.org/W2019583540","https://openalex.org/W2021180976","https://openalex.org/W2026771935","https://openalex.org/W2058258808","https://openalex.org/W2083748805","https://openalex.org/W2097592506","https://openalex.org/W2107284348","https://openalex.org/W2130673833","https://openalex.org/W2295651994","https://openalex.org/W2568031003","https://openalex.org/W4292230561","https://openalex.org/W7099726153"],"related_works":["https://openalex.org/W7096608342","https://openalex.org/W2039100365","https://openalex.org/W3020027665","https://openalex.org/W184144034","https://openalex.org/W189387296","https://openalex.org/W2268573942","https://openalex.org/W2052712469","https://openalex.org/W170415682","https://openalex.org/W2115334306","https://openalex.org/W2963322535"],"abstract_inverted_index":{"We":[0,111,174],"introduce":[1],"a":[2,18,38,55,72,81,121],"new":[3],"technique":[4,90],"for":[5,120,171,179],"proving":[6,116],"kernelization":[7,117],"lower":[8,105,118,177],"bounds,":[9],"called":[10],"cross-composition.":[11],"A":[12],"classical":[13],"problem":[14,20,69,74],"L":[15],"cross-composes":[16,70],"into":[17,71],"parameterized":[19,73],"$Q$":[21],"if":[22,66],"an":[23,67],"instance":[24],"of":[25,37,40,42,97,102,123,152],"Q":[26,75,77],"with":[27,127,145],"polynomially":[28],"bounded":[29],"parameter":[30,109],"value":[31],"can":[32],"express":[33],"the":[34,85,94,104,148,153,157,162],"logical":[35],"OR":[36],"sequence":[39],"instances":[41],"L.":[43],"Building":[44],"on":[45],"work":[46],"by":[47,57,115],"Bodlaender":[48],"et":[49],"al.":[50],"(ICALP":[51],"2008)":[52,62],"and":[53,59,92,101,135],"using":[54,98],"result":[56],"Fortnow":[58],"Santhanam":[60],"(STOC":[61],"we":[63],"show":[64,112],"that":[65,164],"NP-hard":[68],"then":[76],"does":[78],"not":[79,141],"admit":[80,142],"polynomial":[82,86,108,143,158],"kernel":[83],"unless":[84,156],"hierarchy":[87,159],"collapses.":[88],"Our":[89],"generalizes":[91],"strengthens":[93],"recent":[95],"techniques":[96],"OR-composition":[99],"algorithms":[100],"transferring":[103],"bounds":[106,119,178],"via":[107],"transformations.":[110],"its":[113],"applicability":[114],"number":[122,151],"important":[124],"graphs":[125,155],"problems":[126,166],"structural":[128],"(non-standard)":[129],"parameterizations,":[130],"e.g.,":[131],"Chromatic":[132],"Number,":[133],"Clique,":[134],"Weighted":[136],"Feedback":[137,180],"Vertex":[138,181],"Set":[139],"do":[140],"kernels":[144],"respect":[146],"to":[147],"vertex":[149],"cover":[150],"input":[154],"collapses,":[160],"contrasting":[161],"fact":[163],"these":[165],"are":[167],"trivially":[168],"fixed-parameter":[169],"tractable":[170],"this":[172],"parameter.":[173],"have":[175],"similar":[176],"Set.":[182]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2950782844","counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":20}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2025-10-10T00:00:00"}
