{"id":"https://openalex.org/W4416267086","doi":"https://doi.org/10.1007/s00453-025-01354-4","title":"From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem","display_name":"From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4416267086","doi":"https://doi.org/10.1007/s00453-025-01354-4","pmid":"https://pubmed.ncbi.nlm.nih.gov/41256910"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01354-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01354-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s00453-025-01354-4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, University of London, Egham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"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 Kanj","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5017076947"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34787272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"1","first_page":"8","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7771000266075134,"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.7771000266075134,"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.1006999984383583,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.037700001150369644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8536999821662903},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6164000034332275},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.49889999628067017},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.47189998626708984},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.47029998898506165},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4657999873161316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4577000141143799},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3864000141620636}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8536999821662903},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6164000034332275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.54339998960495},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.49889999628067017},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.47189998626708984},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4657999873161316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4577000141143799},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41100001335144043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38670000433921814},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3864000141620636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38190001249313354},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3310999870300293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3253999948501587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3240000009536743},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3172000050544739},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C90329073","wikidata":"https://www.wikidata.org/wiki/Q914232","display_name":"Ask price","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.25839999318122864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2533000111579895},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-025-01354-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01354-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:41256910","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41256910","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:europepmc.org:11428796","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12620328","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01354-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01354-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2533745686","display_name":"Next Generation of Algorithms for Mixed Integer Linear Programming (MILP)","funder_award_id":"EP/V00252X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6233901216","display_name":null,"funder_award_id":"10.55776/Y1329","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7450560725","display_name":null,"funder_award_id":"10.55776/P36420","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1489366126","https://openalex.org/W1521492695","https://openalex.org/W1594924988","https://openalex.org/W1973264045","https://openalex.org/W1979149941","https://openalex.org/W1993962865","https://openalex.org/W2013089587","https://openalex.org/W2016341899","https://openalex.org/W2024863625","https://openalex.org/W2033556263","https://openalex.org/W2047071281","https://openalex.org/W2047386086","https://openalex.org/W2054204410","https://openalex.org/W2116087731","https://openalex.org/W2133311553","https://openalex.org/W2134332047","https://openalex.org/W2180648128","https://openalex.org/W2415715393","https://openalex.org/W2611328865","https://openalex.org/W2625266575","https://openalex.org/W2835345953","https://openalex.org/W2914414140","https://openalex.org/W3100384259","https://openalex.org/W3117215612","https://openalex.org/W3149450769","https://openalex.org/W3180426741","https://openalex.org/W4210565129","https://openalex.org/W4283813151","https://openalex.org/W4300601563","https://openalex.org/W4307296390","https://openalex.org/W4313406961","https://openalex.org/W6928958302"],"related_works":[],"abstract_inverted_index":{"Several":[0],"works":[1],"have":[2,110],"recently":[3],"investigated":[4],"the":[5,54,67,72,81,91,95,98,118,141],"parameterized":[6,83],"complexity":[7,84],"of":[8,37,39,80,97,152],"data":[9,68],"completion":[10],"problems,":[11],"motivated":[12],"by":[13,52,143],"their":[14],"applications":[15],"in":[16,21,66,140],"machine":[17],"learning,":[18],"and":[19,85],"clustering":[20],"particular.":[22],"Interestingly,":[23],"these":[24],"problems":[25,33,109],"can":[26],"be":[27,114,129],"equivalently":[28],"formulated":[29],"as":[30,155,157],"classical":[31],"graph":[32,60,120],"on":[34,48,58,117,149,161],"induced":[35,150],"subgraphs":[36,151],"powers":[38],"partially-defined":[40],"hypercubes.":[41],"In":[42],"this":[43,49,59,138],"paper,":[44],"we":[45],"follow":[46],"up":[47],"recent":[50],"direction":[51],"investigating":[53],"Independent":[55],"Set":[56],"problem":[57],"class,":[61,121],"which":[62],"has":[63],"been":[64,111],"studied":[65],"science":[69],"setting":[70],"under":[71],"name":[73],"Diversity.":[74],"We":[75,136],"obtain":[76],"a":[77],"comprehensive":[78],"picture":[79],"problem's":[82],"establish":[86],"its":[87],"fixed-parameter":[88,115,126],"tractability":[89,127],"w.r.t.":[90],"solution":[92],"size":[93],"plus":[94],"power":[96],"hypercube.":[99],"Given":[100],"that":[101,145],"several":[102],"such":[103],"First":[104],"Order":[105],"Logic":[106],"(FO)":[107],"definable":[108],"shown":[112],"to":[113,131],"tractable":[116],"considered":[119],"one":[122],"may":[123],"ask":[124],"whether":[125],"could":[128],"extended":[130],"capture":[132],"all":[133],"FO-definable":[134],"problems.":[135],"answer":[137],"question":[139],"negative":[142],"showing":[144],"FO":[146,158],"model":[147,159],"checking":[148,160],"hypercubes":[153],"is":[154],"difficult":[156],"general":[162],"graphs.":[163]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}