{"id":"https://openalex.org/W1987681136","doi":"https://doi.org/10.1145/1007352.1007391","title":"Linear FPT reductions and computational lower bounds","display_name":"Linear FPT reductions and computational lower bounds","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W1987681136","doi":"https://doi.org/10.1145/1007352.1007391","mag":"1987681136"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Texas A&M University, College Station, TX","Texas A&M University, College Station. TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, College Station. TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021456840","display_name":"Xiuzhen Huang","orcid":"https://orcid.org/0000-0003-0498-3131"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiuzhen Huang","raw_affiliation_strings":["Texas A&M University, College Station, TX","Texas A&M University, College Station. TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, College Station. TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad A. Kanj","raw_affiliation_strings":["DePaul University, Chicago, IL","DePaul University, Chicago IL#TAB#"],"affiliations":[{"raw_affiliation_string":"DePaul University, Chicago, IL","institution_ids":["https://openalex.org/I118353179"]},{"raw_affiliation_string":"DePaul University, Chicago IL#TAB#","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112078381","display_name":"Ge Xia","orcid":"https://orcid.org/0000-0001-7536-0826"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ge Xia","raw_affiliation_strings":["Texas A&M University, College Station, TX","Texas A&M University, College Station. TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University, College Station. TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":12.0897,"has_fulltext":false,"cited_by_count":112,"citation_normalized_percentile":{"value":0.99003501,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"221"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9861999750137329,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8517035245895386},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7197117209434509},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.70444256067276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6618664860725403},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6487565040588379},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6073716282844543},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5886169075965881},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5700733065605164},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5489396452903748},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5269250273704529},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5248382687568665},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5010380744934082},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4931480288505554},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.48027849197387695},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4745562672615051},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4356154501438141},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43552166223526},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.42860543727874756},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.4229894280433655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35956528782844543},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3188972473144531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20507723093032837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14830613136291504},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.10610014200210571}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8517035245895386},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7197117209434509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.70444256067276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6618664860725403},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6487565040588379},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6073716282844543},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5886169075965881},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5700733065605164},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5489396452903748},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5269250273704529},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5248382687568665},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5010380744934082},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4931480288505554},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.48027849197387695},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4745562672615051},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4356154501438141},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43552166223526},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.42860543727874756},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.4229894280433655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35956528782844543},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3188972473144531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20507723093032837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14830613136291504},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10610014200210571},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1504650505","https://openalex.org/W1529279241","https://openalex.org/W1840899162","https://openalex.org/W1964502706","https://openalex.org/W1971756951","https://openalex.org/W1979740015","https://openalex.org/W1983156760","https://openalex.org/W1995725694","https://openalex.org/W2007979101","https://openalex.org/W2018964411","https://openalex.org/W2026771935","https://openalex.org/W2027049731","https://openalex.org/W2027999353","https://openalex.org/W2038225707","https://openalex.org/W2043177640","https://openalex.org/W2043997666","https://openalex.org/W2048685245","https://openalex.org/W2073025989","https://openalex.org/W2097844290","https://openalex.org/W2137560895","https://openalex.org/W2144452581","https://openalex.org/W2177603603","https://openalex.org/W2229615128","https://openalex.org/W2913688336","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W2077783414","https://openalex.org/W1966805076","https://openalex.org/W2044818254","https://openalex.org/W168093571","https://openalex.org/W2133668753","https://openalex.org/W2012700732","https://openalex.org/W1980842804"],"abstract_inverted_index":{"We":[0],"develop":[1],"new":[2],"techniques":[3,157],"for":[4,11,77,117,149,169,184,205],"deriving":[5],"very":[6],"strong":[7,143],"computational":[8,163],"lower":[9,144,164],"bounds":[10,145,165],"a":[12,34,44,51,131,137,186],"class":[13],"of":[14,47,53,97,124,133,139,201],"well-known":[15],"NP-hard":[16,170,179],"problems,":[17],"including":[18],"weighted":[19],"satisfiability,":[20],"dominating":[21],"set,":[22,24],"hitting":[23],"set":[25],"cover,":[26],"clique,":[27],"and":[28],"independent":[29],"set.":[30],"For":[31,173],"example,":[32,174],"although":[33],"trivial":[35],"enumeration":[36],"can":[37,128,158],"easily":[38],"test":[39,129],"in":[40,64,73,152,214],"time":[41,74,126,188,198,203],"O(nk)":[42],"if":[43,82,107,130],"given":[45],"graph":[46,132],"n":[48,134],"vertices":[49,135],"has":[50,136,191,195],"clique":[52,138],"size":[54,140],"k,":[55],"we":[56,83,103,108,175],"prove":[57,104,176],"that":[58,105,177],"unless":[59,209],"an":[60,93,210],"unlikely":[61,211],"collapse":[62,212],"occurs":[63,213],"parameterized":[65,215],"complexity":[66,216],"theory,":[67],"the":[68,85,100,110,153,178],"problem":[69],"is":[70],"not":[71],"solvable":[72],"f(k)":[75],"no(k)":[76,127],"any":[78,118,206],"function":[79,96,120,207],"f,":[80],"even":[81,106],"restrict":[84,109],"parameter":[86,111],"value":[87],"k":[88,113],"to":[89,114,161],"be":[90,115,159],"bounded":[91],"by":[92],"arbitrarily":[94],"small":[95],"n.":[98],"Under":[99],"same":[101],"assumption,":[102],"values":[112],"\u0398(\u03bc(n))":[116],"reasonable":[119],"\u03bc,":[121],"no":[122,196],"algorithm":[123],"running":[125,202],"k.":[141],"Similar":[142],"are":[146],"also":[147],"derived":[148],"other":[150],"problems":[151],"above":[154],"class.":[155],"Our":[156],"extended":[160],"derive":[162],"on":[166],"approximation":[167,189,199],"algorithms":[168],"optimization":[171],"problems.":[172],"distinguishing":[180],"substring":[181],"selection":[182],"problem,":[183],"which":[185],"polynomial":[187,197],"scheme":[190],"been":[192],"recently":[193],"developed,":[194],"schemes":[200],"f(1/\u03b5)no(1/\u03b5)":[204],"f":[208],"theory.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}