{"id":"https://openalex.org/W3036487380","doi":"https://doi.org/10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","display_name":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W3036487380","doi":"https://doi.org/10.1145/3470869","mag":"3036487380"},"language":"en","primary_location":{"id":"doi:10.1145/3470869","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470869","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2006.10364","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060554413","display_name":"Spoorthy Gunda","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Spoorthy Gunda","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada","[Simon Fraser University]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"[Simon Fraser University]","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080656954","display_name":"Pallavi Jain","orcid":"https://orcid.org/0000-0002-1731-8993"},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pallavi Jain","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, Jodhpur, India","[Indian Institute of Technology Jodhpur]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, Jodhpur, India","institution_ids":["https://openalex.org/I154549908"]},{"raw_affiliation_string":"[Indian Institute of Technology Jodhpur]","institution_ids":["https://openalex.org/I154549908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California, Santa Barbara, California, USA","University of California Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, California, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","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"]},{"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":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["The Institute of Mathematical Sciences, HBNI, Chennai, India and University of Bergen, Bergen, Norway","Institute of Mathematical Sciences, Chennai#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, HBNI, Chennai, India and University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I59611059","https://openalex.org/I4432739"]},{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai#TAB#","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035477873","display_name":"Prafullkumar Tale","orcid":"https://orcid.org/0000-0001-9753-0523"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Prafullkumar Tale","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","Max-Planck-Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5060554413"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02021686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9980999827384949,"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/T11567","display_name":"semigroups and automata theory","score":0.9915000200271606,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7708479166030884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7494220733642578},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6355615854263306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5965144038200378},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.500354528427124},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.49007976055145264},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43315309286117554},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4195128083229065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.393228679895401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39314723014831543},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23242396116256714},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1296851634979248},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0722554624080658}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7708479166030884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7494220733642578},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6355615854263306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5965144038200378},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.500354528427124},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.49007976055145264},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43315309286117554},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4195128083229065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.393228679895401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39314723014831543},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23242396116256714},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1296851634979248},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0722554624080658},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/3470869","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470869","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2006.10364","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.10364","pdf_url":"https://arxiv.org/pdf/2006.10364","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"},{"id":"pmh:oai:drops-oai.dagstuhl.de:12654","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.51","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol176-approx-random2020/LIPIcs.APPROX-RANDOM.2020.51/LIPIcs.APPROX-RANDOM.2020.51.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,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.mpg.de:item_3268050","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0007-874F-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.2006.10364","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2006.10364","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.approx/random.2020.51","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2020.51","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:3036487380","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2006.10364","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.10364","pdf_url":"https://arxiv.org/pdf/2006.10364","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/G6299013311","display_name":null,"funder_award_id":"2017-18","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G6774542772","display_name":null,"funder_award_id":"819416","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8492173084","display_name":null,"funder_award_id":"DST/SJF/MSA01/2017-18","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G971706015","display_name":"Systematic mapping of the complexity landscape of hard algorithmic graph problems","funder_award_id":"725978","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W78635179","https://openalex.org/W281935416","https://openalex.org/W1561738351","https://openalex.org/W1589219240","https://openalex.org/W1674929459","https://openalex.org/W1832264756","https://openalex.org/W1867877755","https://openalex.org/W1881622208","https://openalex.org/W1985427743","https://openalex.org/W2003744153","https://openalex.org/W2006468321","https://openalex.org/W2022137727","https://openalex.org/W2048845385","https://openalex.org/W2062347470","https://openalex.org/W2064600658","https://openalex.org/W2065067474","https://openalex.org/W2144050783","https://openalex.org/W2165648442","https://openalex.org/W2174231092","https://openalex.org/W2271457994","https://openalex.org/W2277578521","https://openalex.org/W2570366614","https://openalex.org/W2579312895","https://openalex.org/W2604407595","https://openalex.org/W2741133644","https://openalex.org/W2763619719","https://openalex.org/W2773937539","https://openalex.org/W2909144890","https://openalex.org/W2911549278","https://openalex.org/W2949267003","https://openalex.org/W2962676809","https://openalex.org/W2962710864","https://openalex.org/W2962874115","https://openalex.org/W2963378411","https://openalex.org/W2963439929","https://openalex.org/W2963957639","https://openalex.org/W2976369687","https://openalex.org/W2977752076","https://openalex.org/W3037887708","https://openalex.org/W3205330907","https://openalex.org/W6732227212","https://openalex.org/W6736197793","https://openalex.org/W6746940593"],"related_works":["https://openalex.org/W3196689725","https://openalex.org/W2991433568","https://openalex.org/W194907680","https://openalex.org/W2091264711","https://openalex.org/W2941239814","https://openalex.org/W3204830310","https://openalex.org/W2962878949","https://openalex.org/W2952697837","https://openalex.org/W1550062525","https://openalex.org/W2951094307","https://openalex.org/W2979496305","https://openalex.org/W2230640495","https://openalex.org/W2979919423","https://openalex.org/W2516984173","https://openalex.org/W2900958825","https://openalex.org/W121729551","https://openalex.org/W1921482839","https://openalex.org/W1505555274","https://openalex.org/W3103672472","https://openalex.org/W2085468469"],"abstract_inverted_index":{"A":[0],"graph":[1,16,97,129],"operation":[2],"that":[3,114,174,286,326,354],"contracts":[4],"edges":[5,30,135],"is":[6,82,127,153,208,253,274,303,316,329,387],"one":[7,68],"of":[8,15,20,25,47,52,58,85,91,377],"the":[9,13,50,56,76,89,128,141,145,287,337],"fundamental":[10],"operations":[11],"in":[12,55,88,136,219,344,388],"theory":[14],"minors.":[17],"Parameterized":[18],"Complexity":[19],"editing":[21],"to":[22,63,155,210,276,294],"a":[23,83,96,169,177,189,225,235],"family":[24],"graphs":[26],"by":[27,133,284],"contracting":[28,134],"k":[29,102,123,197,322,369,383],"has":[31],"recently":[32],"gained":[33],"substantial":[34],"scientific":[35],"attention,":[36],"and":[37,99,118,347,364],"several":[38],"new":[39],"results":[40,143],"have":[41,61],"been":[42],"obtained.":[43],"Some":[44],"important":[45],"families":[46],"graphs,":[48,54,87],"namely,":[49],"subfamilies":[51],"chordal":[53,86],"context":[57],"edge":[59,374],"contractions,":[60],"proven":[62],"be":[64,156,211,277,292],"significantly":[65],"difficult":[66],"than":[67],"might":[69],"expect.":[70],"In":[71],"this":[72,216,282],"article,":[73],"we":[74,223,246],"study":[75],"F":[77,81,104,117,146,338,363,389],"-Contraction":[78,105,339],"problem,":[79,340],"where":[80],"subfamily":[84],"realm":[90],"parameterized":[92],"approximation.":[93],"Formally,":[94],"given":[95],"G":[98,132],"an":[100,317,327,330,373],"integer":[101],",":[103,164,251,301,370],"asks":[106],"whether":[107],"there":[108,252,302,355],"exists":[109,356],"X":[110,120,137,357,366],"\u2286":[111,358],"E(G)":[112,359],"such":[113,353],"G/X":[115,126,361],"\u2208":[116,362],"|":[119,121,365,367],"\u2264":[122,368],".":[124,138,158,213,262,279,313,390],"Here,":[125,263,314],"obtained":[130],"from":[131],"We":[139,172,214,280,324],"obtain":[140],"following":[142],"for":[144,200,229,241,259,310,336,384],"-":[147,306,332],"Contraction":[148,152,207,231,243,261,273,312],"problem:":[149],"\u2022":[150,205,271],"Clique":[151],"known":[154,209,275],"FPT":[157,238,256,298,307,333,345],"However,":[159],"unless":[160],"NP\u2286":[161],"coNP/":[162],"poly":[163],"it":[165,175,187,342,371],"does":[166],"not":[167],"admit":[168],"polynomial":[170,227],"kernel.":[171],"show":[173,247,295],"admits":[176,188],"polynomial-size":[178],"approximate":[179],"kernelization":[180],"scheme":[181],"(":[182,196],"PSAKS":[183],").":[184,244],"That":[185],"is,":[186],"(1":[190],"+":[191],"\u03b5)-approximate":[192],"kernel":[193,228],"with":[194],"O":[195],"f(\u03b5))":[198],"vertices":[199],"every":[201],"\u03b5":[202],">":[203,266],"0.":[204],"Split":[206,230,242,260],"W[1]-Hard":[212],"deconstruct":[215],"intractability":[217],"result":[218,283],"two":[220],"ways.":[221],"First,":[222],"give":[224],"(2+\u03b5)-approximate":[226],"(which":[232],"also":[233],"implies":[234],"factor":[236],"(2+\u03b5)-":[237],"-approximation":[239,257,308,334],"algorithm":[240,258,309,328,335],"Furthermore,":[245],"that,":[248,296],"assuming":[249,297],"Gap-ETH":[250],"no":[254,304],"(5/4-\u03b4)-":[255],"\u03b5,":[264],"\u03b4":[265],"0":[267],"are":[268],"fixed":[269],"constants.":[270],"Chordal":[272,311],"W[2]-Hard":[278],"complement":[281],"observing":[285],"existing":[288],"W[2]-hardness":[289],"reduction":[290],"can":[291],"adapted":[293],"\u2260":[299],"W[1]":[300],"F(k)":[305,315],"arbitrary":[318],"function":[319],"depending":[320],"on":[321,348],"alone.":[323],"say":[325],"h(k)":[331,381],"if":[341],"runs":[343],"time,":[346],"any":[349],"input":[350],"(G,":[351],"k)":[352],"satisfying":[360],"outputs":[372],"set":[375],"Y":[376],"size":[378],"at":[379],"most":[380],"\u010b":[382],"which":[385],"G/Y":[386]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2025-10-10T00:00:00"}