{"id":"https://openalex.org/W2803460775","doi":"https://doi.org/10.1137/16m1104834","title":"Slightly Superexponential Parameterized Problems","display_name":"Slightly Superexponential Parameterized Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2803460775","doi":"https://doi.org/10.1137/16m1104834","mag":"2803460775"},"language":"en","primary_location":{"id":"doi:10.1137/16m1104834","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1104834","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1902.08723","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","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), Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["The Institute of Mathematical Sciences, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3568,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.96398187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"47","issue":"3","first_page":"675","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9639999866485596,"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"}},{"id":"https://openalex.org/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9617999792098999,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9635730981826782},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.8327577114105225},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.7157442569732666},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6540247201919556},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5834592580795288},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5412764549255371},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5116844177246094},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4596836566925049},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44702789187431335},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4343889057636261},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.42070186138153076},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4193379282951355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39580199122428894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34151774644851685},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07300230860710144}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9635730981826782},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.8327577114105225},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.7157442569732666},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6540247201919556},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5834592580795288},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5412764549255371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5116844177246094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4596836566925049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44702789187431335},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4343889057636261},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.42070186138153076},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4193379282951355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39580199122428894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34151774644851685},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07300230860710144},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1104834","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1104834","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1902.08723","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.08723","pdf_url":"https://arxiv.org/pdf/1902.08723","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:1902.08723","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.08723","pdf_url":"https://arxiv.org/pdf/1902.08723","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":[{"id":"https://openalex.org/G4269630183","display_name":null,"funder_award_id":"306992","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G4750090969","display_name":"Pareto-Optimal Parameterized Algorithms","funder_award_id":"715744","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G5108384764","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G6606324840","display_name":null,"funder_award_id":"755978","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W100926944","https://openalex.org/W1542263829","https://openalex.org/W1682888911","https://openalex.org/W1964541472","https://openalex.org/W1968541942","https://openalex.org/W1971393213","https://openalex.org/W1979149941","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2005309613","https://openalex.org/W2016590962","https://openalex.org/W2019404372","https://openalex.org/W2027999353","https://openalex.org/W2032287082","https://openalex.org/W2044713370","https://openalex.org/W2047386086","https://openalex.org/W2051856222","https://openalex.org/W2054702649","https://openalex.org/W2059451253","https://openalex.org/W2060632898","https://openalex.org/W2062088872","https://openalex.org/W2086331454","https://openalex.org/W2088330156","https://openalex.org/W2092904196","https://openalex.org/W2146221397","https://openalex.org/W2157295389","https://openalex.org/W2158584754","https://openalex.org/W2160237261","https://openalex.org/W2164428079","https://openalex.org/W2165094933","https://openalex.org/W2165621523","https://openalex.org/W2167377888","https://openalex.org/W2296148711","https://openalex.org/W3102351898","https://openalex.org/W3139078859","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2803460775","https://openalex.org/W4389156785","https://openalex.org/W2087638517","https://openalex.org/W2113885662","https://openalex.org/W2800485060","https://openalex.org/W2492498253","https://openalex.org/W1777044164","https://openalex.org/W2953073202","https://openalex.org/W4299290985","https://openalex.org/W4298060463"],"abstract_inverted_index":{"A":[0,102],"central":[1],"problem":[2,244,287,335,370],"in":[3,80,112,139,158,252,311,339,374,469,475],"parameterized":[4,37,40,132],"algorithms":[5,9,41,119],"is":[6,18,44,85,107,120,136,210,237,247,320,355,390],"to":[7,98,105,165,249],"obtain":[8,402],"with":[10,303],"running":[11,59,83,114,142,160],"time":[12,60,84,115,161,274,312,325,340,360,375,395],"$f(k)\\cdot":[13],"n^{O(1)}$":[14,256,269,273,324,343,359,378,394],"such":[15,57,149,222],"that":[16,46,153,223,263,289,318,353,388],"$f$":[17],"as":[19,28,67],"slow":[20],"growing":[21],"a":[22,32,58,61,146,214,293,297,428],"function":[23],"of":[24,35,74,116,124,148,200,219,229,346,381,413,446],"the":[25,77,81,109,113,117,140,154,159,171,187,208,230,277,301,328,363,398,408,476],"parameter":[26],"$k$":[27,157],"possible.":[29],"In":[30,127,186],"particular,":[31],"large":[33],"number":[34,147],"basic":[36,414],"problems":[38,66,75,133,150,438],"admit":[39],"where":[42,76,134],"$f(k)$":[43,78,110,135],"single-exponential,":[45],"is,":[47,290],"$c^k$":[48],"for":[49,56,64,122,145,176,411,432],"some":[50],"constant":[51],"$c$,":[52],"which":[53],"makes":[54],"aiming":[55],"natural":[62,103,178,437],"goal":[63],"other":[65],"well.":[68],"However,":[69],"there":[70,212,264,319,354,389],"are":[71,265],"still":[72],"plenty":[73],"appearing":[79,111],"best-known":[82,118,141],"worse":[86],"than":[87],"single-exponential":[88],"and":[89,144,204,257,420,443,462],"it":[90,100,465],"remained":[91],"\u201cslightly":[92],"superexponential\u201d":[93],"even":[94,471],"after":[95],"serious":[96],"attempts":[97],"bring":[99],"down.":[101],"question":[104,209],"ask":[106],"whether":[108,211,292],"optimal":[121],"any":[123,440],"these":[125],"problems.":[126],"this":[128],"paper,":[129],"we":[130,151,169,405,463],"examine":[131],"$k^{O(k)}=2^{O(k\\log":[137],"k)}$":[138],"time,":[143],"show":[152,262,317,352,387],"dependence":[155],"on":[156,344,379,436],"cannot":[162],"be":[163,250,309,337,372,445],"improved":[164],"single-exponential.":[166],"More":[167],"precisely":[168],"prove":[170,407,467],"following":[172],"tight":[173,455],"lower":[174,409,434,456,473],"bounds,":[175],"four":[177],"problems,":[179],"arising":[180],"from":[181,227],"three":[182],"different":[183],"domains:":[184],"(1)":[185],"Closest":[188,245],"String":[189,246],"problem,":[190],"given":[191],"strings":[192,231],"$s_1$,":[193],"$\\dots$,":[194],"$s_t$":[195],"over":[196,217],"an":[197,205],"alphabet":[198],"$\\Sigma$":[199,218],"length":[201,220],"$L$":[202],"each,":[203],"integer":[206],"$d$,":[207],"exists":[213],"string":[215],"$s$":[216],"$L$,":[221],"its":[224],"hamming":[225],"distance":[226],"each":[228],"$s_i$,":[232],"$1\\leq":[233],"i":[234],"\\leq":[235],"t$,":[236],"at":[238,305,348,383],"most":[239,306,349,384],"$d$.":[240],"The":[241,284,332,367],"pattern":[242],"matching":[243],"known":[248],"solvable":[251],"times":[253],"$2^{O(d\\log":[254,258,313],"d)}\\cdot":[255,268,314,323],"|\\Sigma|)}\\cdot":[259,272],"n^{O(1)}$.":[260,315],"We":[261,316,351,386],"no":[266,321,356,391],"$2^{o(d\\log":[267,271,322],"or":[270],"algorithms,":[275],"unless":[276,327,362,397],"Exponential":[278],"Time":[279],"Hypothesis":[280],"(ETH)":[281],"fails.":[282,330,365,400],"(2)":[283],"graph":[285,294],"embedding":[286,299],"Distortion,":[288],"deciding":[291],"$G$":[295],"has":[296],"metric":[298],"into":[300],"integers":[302],"distortion":[304],"$d$":[307],"can":[308,336,371],"solved":[310,338,373],"algorithm,":[326,361,396],"ETH":[329,364,399],"(3)":[331],"Disjoint":[333],"Paths":[334],"$2^{O(w\\log":[341,376],"w)}\\cdot":[342,358,377,393],"graphs":[345,380],"treewidth":[347,382],"$w$.":[350,385],"$2^{o(w\\log":[357,392],"(4)":[366],"Chromatic":[368],"Number":[369],"To":[401],"our":[403,460],"results,":[404],"first":[406],"bound":[410],"variants":[412,426],"problems:":[415],"finding":[416],"cliques,":[417],"independent":[418,447],"sets,":[419],"hitting":[421],"sets.":[422],"These":[423],"artificially":[424],"constrained":[425],"form":[427],"good":[429],"starting":[430],"point":[431],"proving":[433],"bounds":[435,457,474],"without":[439],"technical":[441],"restrictions":[442],"could":[444],"interest.":[448],"Several":[449],"follow-up":[450],"works":[451],"have":[452],"already":[453],"obtained":[454],"by":[458],"using":[459],"framework,":[461],"believe":[464],"will":[466],"useful":[468],"obtaining":[470],"more":[472],"future.":[477]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}