{"id":"https://openalex.org/W4411320034","doi":"https://doi.org/10.1145/3717823.3718257","title":"Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity","display_name":"Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411320034","doi":"https://doi.org/10.1145/3717823.3718257"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/164615/1/3717823.3718257.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039083557","display_name":"Mitali Bafna","orcid":"https://orcid.org/0000-0002-3003-2017"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mitali Bafna","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-3003-2017","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069125307","display_name":"C. S. Karthik","orcid":"https://orcid.org/0000-0001-9105-364X"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Rutgers University, Piscataway, USA"],"raw_orcid":"https://orcid.org/0000-0001-9105-364X","affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-8093-1328","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039083557"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.3257,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82766093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2118","last_page":"2129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.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"}},{"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.943016767501831},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7540228366851807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.517308235168457},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48355934023857117},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4835245609283447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3491687774658203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27345898747444153},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05847954750061035}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.943016767501831},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7540228366851807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.517308235168457},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48355934023857117},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4835245609283447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3491687774658203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27345898747444153},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05847954750061035}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/164615","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/164615","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/164615/1/3717823.3718257.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/164615","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/164615","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/164615/1/3717823.3718257.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411320034.pdf","grobid_xml":"https://content.openalex.org/works/W4411320034.grobid-xml"},"referenced_works_count":77,"referenced_works":["https://openalex.org/W1886138972","https://openalex.org/W1970259241","https://openalex.org/W1973652906","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2007385254","https://openalex.org/W2010271471","https://openalex.org/W2019578639","https://openalex.org/W2027048490","https://openalex.org/W2029859729","https://openalex.org/W2038691311","https://openalex.org/W2074844420","https://openalex.org/W2086423976","https://openalex.org/W2086653003","https://openalex.org/W2087900794","https://openalex.org/W2117654132","https://openalex.org/W2122793266","https://openalex.org/W2125632628","https://openalex.org/W2146261818","https://openalex.org/W2148352980","https://openalex.org/W2150004999","https://openalex.org/W2153413398","https://openalex.org/W2155618818","https://openalex.org/W2156397150","https://openalex.org/W2218607027","https://openalex.org/W2256089709","https://openalex.org/W2294255905","https://openalex.org/W2339349649","https://openalex.org/W2576456765","https://openalex.org/W2893188841","https://openalex.org/W2911985665","https://openalex.org/W2942833401","https://openalex.org/W2944399784","https://openalex.org/W2962710864","https://openalex.org/W2963364229","https://openalex.org/W2964171575","https://openalex.org/W2964642894","https://openalex.org/W2966797629","https://openalex.org/W2968783941","https://openalex.org/W2972099370","https://openalex.org/W2972926935","https://openalex.org/W2975522469","https://openalex.org/W2977536198","https://openalex.org/W3001868306","https://openalex.org/W3002240277","https://openalex.org/W3036402366","https://openalex.org/W3044099633","https://openalex.org/W3083045876","https://openalex.org/W3102777411","https://openalex.org/W3129091168","https://openalex.org/W3145543370","https://openalex.org/W3155138594","https://openalex.org/W3167294045","https://openalex.org/W3170397223","https://openalex.org/W3171131516","https://openalex.org/W3213983356","https://openalex.org/W3216479112","https://openalex.org/W4200635920","https://openalex.org/W4233774180","https://openalex.org/W4316652465","https://openalex.org/W4376639559","https://openalex.org/W4390098188","https://openalex.org/W4390590029","https://openalex.org/W4391511826","https://openalex.org/W4391555747","https://openalex.org/W4391901114","https://openalex.org/W4399520876","https://openalex.org/W4399521632","https://openalex.org/W4399522433","https://openalex.org/W4399523655","https://openalex.org/W4400667768","https://openalex.org/W4404849782","https://openalex.org/W4406141774","https://openalex.org/W4406143054","https://openalex.org/W4411319981","https://openalex.org/W4411320001","https://openalex.org/W6910307778"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2171811389","https://openalex.org/W1539117866","https://openalex.org/W2041837101","https://openalex.org/W1034070228"],"abstract_inverted_index":{"Mitali":[0],"Bafna,":[1],"Karthik":[2],"C.":[3],"S.,":[4],"and":[5],"Dor":[6],"Minzer.":[7],"2025.":[8],"Near":[9],"Optimal":[10],"Constant":[11],"Inapproximability":[12],"under":[13],"ETH":[14],"for":[15,36],"Fundamental":[16],"Problems":[17],"in":[18],"Parameterized":[19],"Complexity.":[20],"In":[21],"Proceedings":[22],"of":[23,31],"the":[24],"57th":[25],"Annual":[26],"ACM":[27],"Symposium":[28],"on":[29],"Theory":[30],"Computing":[32,37],"(STOC":[33],"'25).":[34],"Association":[35],"Machinery,":[38],"New":[39],"York,":[40],"NY,":[41],"USA,":[42],"2118\u20132129.":[43]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}