From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of power...
Uloženo v:
| Vydáno v: | Algorithmica Ročník 88; číslo 1; s. 8 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer US
01.02.2026
Springer Nature B.V |
| Témata: | |
| ISSN: | 0178-4617, 1432-0541 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of powers of partially-defined hypercubes. In this paper, we follow up on this recent direction by investigating the Independent Set problem on this graph class, which has been studied in the data science setting under the name Diversity. We obtain a comprehensive picture of the problem’s parameterized complexity and establish its fixed-parameter tractability w.r.t. the solution size plus the power of the hypercube. Given that several such First Order Logic (FO) definable problems have been shown to be fixed-parameter tractable on the considered graph class, one may ask whether fixed-parameter tractability could be extended to capture all FO-definable problems. We answer this question in the negative by showing that FO model checking on induced subgraphs of hypercubes is as difficult as FO model checking on general graphs. |
|---|---|
| AbstractList | Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of powers of partially-defined hypercubes. In this paper, we follow up on this recent direction by investigating the Independent Set problem on this graph class, which has been studied in the data science setting under the name Diversity. We obtain a comprehensive picture of the problem’s parameterized complexity and establish its fixed-parameter tractability w.r.t. the solution size plus the power of the hypercube. Given that several such First Order Logic (FO) definable problems have been shown to be fixed-parameter tractable on the considered graph class, one may ask whether fixed-parameter tractability could be extended to capture all FO-definable problems. We answer this question in the negative by showing that FO model checking on induced subgraphs of hypercubes is as difficult as FO model checking on general graphs. Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of powers of partially-defined hypercubes. In this paper, we follow up on this recent direction by investigating the Independent Set problem on this graph class, which has been studied in the data science setting under the name Diversity. We obtain a comprehensive picture of the problem's parameterized complexity and establish its fixed-parameter tractability w.r.t. the solution size plus the power of the hypercube. Given that several such First Order Logic (FO) definable problems have been shown to be fixed-parameter tractable on the considered graph class, one may ask whether fixed-parameter tractability could be extended to capture all FO-definable problems. We answer this question in the negative by showing that FO model checking on induced subgraphs of hypercubes is as difficult as FO model checking on general graphs.Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of powers of partially-defined hypercubes. In this paper, we follow up on this recent direction by investigating the Independent Set problem on this graph class, which has been studied in the data science setting under the name Diversity. We obtain a comprehensive picture of the problem's parameterized complexity and establish its fixed-parameter tractability w.r.t. the solution size plus the power of the hypercube. Given that several such First Order Logic (FO) definable problems have been shown to be fixed-parameter tractable on the considered graph class, one may ask whether fixed-parameter tractability could be extended to capture all FO-definable problems. We answer this question in the negative by showing that FO model checking on induced subgraphs of hypercubes is as difficult as FO model checking on general graphs. |
| ArticleNumber | 8 |
| Author | Ordyniak, Sebastian Ganian, Robert Kanj, Iyad Eiben, Eduard Szeider, Stefan |
| Author_xml | – sequence: 1 givenname: Eduard surname: Eiben fullname: Eiben, Eduard organization: Department of Computer Science, Royal Holloway, University of London – sequence: 2 givenname: Robert surname: Ganian fullname: Ganian, Robert organization: Algorithms and Complexity Group, TU Wien – sequence: 3 givenname: Iyad surname: Kanj fullname: Kanj, Iyad organization: School of Computing, DePaul University – sequence: 4 givenname: Sebastian surname: Ordyniak fullname: Ordyniak, Sebastian email: sordyniak@gmail.com organization: School of Computing, University of Leeds – sequence: 5 givenname: Stefan surname: Szeider fullname: Szeider, Stefan organization: Algorithms and Complexity Group, TU Wien |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/41256910$$D View this record in MEDLINE/PubMed |
| BookMark | eNp90c1u1DAUBWALtaLTwguwQJbYdBO4_k_YjQZKK1VqJWBt2clNSZXEwXYWw9PXdFqQWLCxZek717LPKTmaw4yEvGHwngGYDwlAKlEBVxUwoWQlX5ANk4JXoCQ7Ihtgpq6kZuaEnKZ0D8C4afRLciIZV7phsCF3FzFM9JPLju7CtIyYhzDTHOhtDH7EKdFyvNwvGNvVY_pIt_TWRTdhxjj8wo5uZzfu01BcT_MPpFdzhwuWZc70K-bnOa_Ice_GhK-f9jPy_eLzt91ldX3z5Wq3va5aYXiuZA_guGRaKINKe995LaQH3siWeeNr7Nu-NqLjgnOlHK-ZRpAtMA_ONbU4I-eHuUsMP1dM2U5DanEc3YxhTVZwI0AIoaHQd__Q-7DG8pxHxUWjlWqKevukVj9hZ5c4TC7u7fMXFsAPoI0hpYj9H8LA_u7JHnqypSf72JOVJSQOoVTwfIfx793_ST0AwBaS7A |
| Cites_doi | 10.1007/s00453-003-1028-3 10.1109/TPAMI.2013.57 10.1007/978-3-031-09574-0_7 10.1016/S1570-8667(03)00079-0 10.1145/506147.506150 10.1145/3051095 10.1007/3-540-46632-0_44 10.1016/0304-3975(85)90224-5 10.1609/aaai.v36i4.20306 10.1112/jlms/s1-35.1.85 10.1201/9781420034912 10.1609/aaai.v35i8.16896 10.1017/CBO9781139924801 10.1137/1.9780898718348 10.4230/LIPIcs.IPEC.2023.16 10.1016/j.jcss.2003.07.014 10.1145/3221269.3221290 10.1007/s10208-009-9045-5 10.1007/978-1-4471-5559-1 10.1016/0898-1221(88)90213-1 10.1137/1.9781611976465.157 10.1016/j.disc.2005.12.045 10.1016/j.jcss.2020.10.005 10.1016/j.jcss.2022.12.001 10.1016/j.tcs.2015.06.043 10.1109/TIT.2010.2044061 10.1109/JPROC.2009.2035722 10.1016/j.jcss.2022.10.001 10.1007/978-3-319-21275-3 10.1016/0167-6377(85)90002-1 10.1007/978-3-662-07003-1 10.1145/62212.62255 |
| ContentType | Journal Article |
| Copyright | Crown 2025 Crown 2025. Crown 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: Crown 2025 – notice: Crown 2025. – notice: Crown 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION NPM JQ2 7X8 |
| DOI | 10.1007/s00453-025-01354-4 |
| DatabaseName | Springer Nature OA/Free Journals CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic |
| DatabaseTitle | CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic |
| DatabaseTitleList | ProQuest Computer Science Collection PubMed CrossRef MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0541 |
| ExternalDocumentID | 41256910 10_1007_s00453_025_01354_4 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: Austrian Science Fund grantid: 10.55776/Y1329; 10.55776/P36420 funderid: http://dx.doi.org/10.13039/501100002428 – fundername: DePaul University,United States grantid: 602061 – fundername: Engineering and Physical Sciences Research Council grantid: EP/V00252X/1 funderid: http://dx.doi.org/10.13039/501100000266 |
| GroupedDBID | -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 203 23M 2J2 2JN 2JY 2KG 2KM 2LR 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BGNMA BSONS C6C CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI ESBYG FEDTE FERAY FFXSO FIGPU FNLPD FRRFC FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV LAS LLZTM M4Y MA- N9A NB0 NPVJJ NQJWS NU0 O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R89 R9I RHV RNS ROL RPX RSV S16 S1Z S27 S3B SAP SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~EX -Y2 1SB 28- 2P1 2VQ 5QI AAAVM AAOBN AARHV AAYTO AAYXX ABDPE ABFSI ABQSL ABULA ACBXY ADHKG AEBTG AEFIE AEKMD AFEXP AFGCZ AGGDS AGQPQ AI. AJBLW BBWZM BDATZ CAG CITATION COF E.L EJD FINBP FSGXE H13 H~9 KOW N2Q NDZJH O9- R4E RNI RZK S26 S28 SCJ SCLPG T16 UQL VH1 ZY4 NPM JQ2 7X8 |
| ID | FETCH-LOGICAL-c372t-4f00a2416357e56bbdb634b0294c1b7b8efcf873d232255a2816e04c01b0aa983 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001614849900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-4617 |
| IngestDate | Thu Nov 20 00:29:03 EST 2025 Mon Nov 17 16:20:48 EST 2025 Sat Nov 22 01:41:14 EST 2025 Thu Nov 20 00:49:00 EST 2025 Mon Nov 17 01:10:29 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Clustering Data completion Parameterized complexity Independent set problem on hypercubes First Order Logic model checking Diversity |
| Language | English |
| License | Crown 2025. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c372t-4f00a2416357e56bbdb634b0294c1b7b8efcf873d232255a2816e04c01b0aa983 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://link.springer.com/10.1007/s00453-025-01354-4 |
| PMID | 41256910 |
| PQID | 3272396559 |
| PQPubID | 2043795 |
| ParticipantIDs | proquest_miscellaneous_3273033360 proquest_journals_3272396559 pubmed_primary_41256910 crossref_primary_10_1007_s00453_025_01354_4 springer_journals_10_1007_s00453_025_01354_4 |
| PublicationCentury | 2000 |
| PublicationDate | 2026-02-01 |
| PublicationDateYYYYMMDD | 2026-02-01 |
| PublicationDate_xml | – month: 02 year: 2026 text: 2026-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: United States |
| PublicationTitle | Algorithmica |
| PublicationTitleAbbrev | Algorithmica |
| PublicationTitleAlternate | Algorithmica |
| PublicationYear | 2026 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | 1354_CR29 JPH Frank Harary (1354_CR28) 1988; 15 FV Fomin (1354_CR26) 2021; 117 1354_CR27 M Li (1354_CR43) 2002; 49 EJ Candès (1354_CR9) 2009; 9 T Koana (1354_CR41) 2023; 132 P Erdös (1354_CR23) 1960; 1 EJ Candès (1354_CR8) 2010; 98 D Hermelin (1354_CR39) 2015; 600 1354_CR2 E Elhamifar (1354_CR22) 2013; 35 1354_CR1 1354_CR4 1354_CR3 RG Downey (1354_CR14) 2013 L Gąsieniec (1354_CR34) 2004; 2 1354_CR6 1354_CR5 1354_CR24 1354_CR46 1354_CR7 1354_CR40 1354_CR20 TF Gonzalez (1354_CR35) 1985; 38 1354_CR19 L Libkin (1354_CR44) 2004 1354_CR18 T Dvořák (1354_CR15) 2007; 307 M Charikar (1354_CR12) 2004; 68 1354_CR17 1354_CR38 J Flum (1354_CR25) 2006 M Ceccarello (1354_CR11) 2017; 10 B Mirkin (1354_CR45) 2005 E Eiben (1354_CR21) 2023; 134 J Gramm (1354_CR36) 2003; 37 M Grohe (1354_CR37) 2017; 64 J Leskovec (1354_CR42) 2014 1354_CR33 EJ Candès (1354_CR10) 2010; 56 1354_CR32 M Dyer (1354_CR16) 1985; 3 M Cygan (1354_CR13) 2015 1354_CR31 1354_CR30 |
| References_xml | – volume: 37 start-page: 25 issue: 1 year: 2003 ident: 1354_CR36 publication-title: Algorithmica doi: 10.1007/s00453-003-1028-3 – volume: 35 start-page: 2765 issue: 11 year: 2013 ident: 1354_CR22 publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2013.57 – ident: 1354_CR6 doi: 10.1007/978-3-031-09574-0_7 – volume: 2 start-page: 289 issue: 2 year: 2004 ident: 1354_CR34 publication-title: J. Discrete Alg. doi: 10.1016/S1570-8667(03)00079-0 – volume: 49 start-page: 157 issue: 2 year: 2002 ident: 1354_CR43 publication-title: J. ACM doi: 10.1145/506147.506150 – volume: 64 start-page: 1 issue: 3 year: 2017 ident: 1354_CR37 publication-title: J ACM doi: 10.1145/3051095 – ident: 1354_CR27 – ident: 1354_CR7 doi: 10.1007/3-540-46632-0_44 – ident: 1354_CR40 – volume: 38 start-page: 293 year: 1985 ident: 1354_CR35 publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(85)90224-5 – ident: 1354_CR2 – ident: 1354_CR4 doi: 10.1609/aaai.v36i4.20306 – volume: 1 start-page: 85 issue: 1 year: 1960 ident: 1354_CR23 publication-title: J. Lond. Math. Soc. doi: 10.1112/jlms/s1-35.1.85 – volume-title: Clustering For Data Mining: A Data Recovery Approach year: 2005 ident: 1354_CR45 doi: 10.1201/9781420034912 – ident: 1354_CR18 doi: 10.1609/aaai.v35i8.16896 – volume-title: Parameterized Complexity Theory year: 2006 ident: 1354_CR25 – volume-title: Mining of Massive Datasets year: 2014 ident: 1354_CR42 doi: 10.1017/CBO9781139924801 – ident: 1354_CR29 doi: 10.1137/1.9780898718348 – ident: 1354_CR20 doi: 10.4230/LIPIcs.IPEC.2023.16 – ident: 1354_CR33 – ident: 1354_CR31 – volume: 68 start-page: 417 issue: 2 year: 2004 ident: 1354_CR12 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2003.07.014 – ident: 1354_CR46 doi: 10.1145/3221269.3221290 – volume: 9 start-page: 717 issue: 6 year: 2009 ident: 1354_CR9 publication-title: Found. Comput. Math. doi: 10.1007/s10208-009-9045-5 – volume-title: Fundamentals of Parameterized Complexity year: 2013 ident: 1354_CR14 doi: 10.1007/978-1-4471-5559-1 – volume: 15 start-page: 277 issue: 4 year: 1988 ident: 1354_CR28 publication-title: Comput. Math. Appl. doi: 10.1016/0898-1221(88)90213-1 – ident: 1354_CR17 doi: 10.1137/1.9781611976465.157 – volume: 10 start-page: 469 issue: 5 year: 2017 ident: 1354_CR11 publication-title: PVLDB – volume: 307 start-page: 1982 issue: 16 year: 2007 ident: 1354_CR15 publication-title: Discret. Math. doi: 10.1016/j.disc.2005.12.045 – volume: 117 start-page: 50 year: 2021 ident: 1354_CR26 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2020.10.005 – volume: 134 start-page: 1 year: 2023 ident: 1354_CR21 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2022.12.001 – volume: 600 start-page: 11 year: 2015 ident: 1354_CR39 publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2015.06.043 – ident: 1354_CR1 – volume: 56 start-page: 2053 issue: 5 year: 2010 ident: 1354_CR10 publication-title: IEEE Trans Inf. Theory doi: 10.1109/TIT.2010.2044061 – volume: 98 start-page: 925 issue: 6 year: 2010 ident: 1354_CR8 publication-title: Proc. IEEE doi: 10.1109/JPROC.2009.2035722 – volume: 132 start-page: 45 year: 2023 ident: 1354_CR41 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2022.10.001 – volume-title: Parameterized Algorithms year: 2015 ident: 1354_CR13 doi: 10.1007/978-3-319-21275-3 – ident: 1354_CR38 – volume: 3 start-page: 285 issue: 6 year: 1985 ident: 1354_CR16 publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(85)90002-1 – volume-title: Elements of Finite Model Theory year: 2004 ident: 1354_CR44 doi: 10.1007/978-3-662-07003-1 – ident: 1354_CR30 – ident: 1354_CR19 – ident: 1354_CR3 – ident: 1354_CR32 – ident: 1354_CR5 – ident: 1354_CR24 doi: 10.1145/62212.62255 |
| SSID | ssj0012796 |
| Score | 2.4289286 |
| Snippet | Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and... |
| SourceID | proquest pubmed crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 8 |
| SubjectTerms | Algorithm Analysis and Problem Complexity Algorithms Clustering Complexity Computer Science Computer Systems Organization and Communication Networks Data science Data Structures and Information Theory Graph theory Hypercubes Machine learning Mathematics of Computing Parameterization Parameters Theory of Computation |
| Title | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem |
| URI | https://link.springer.com/article/10.1007/s00453-025-01354-4 https://www.ncbi.nlm.nih.gov/pubmed/41256910 https://www.proquest.com/docview/3272396559 https://www.proquest.com/docview/3273033360 |
| Volume | 88 |
| WOSCitedRecordID | wos001614849900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB6xwKGXQoHShQUZqbcSybGd2OGGgBWVKrQq7Wpvke04VQ8k1SbbA7-ecV5VtXCAY2RrYnk8ns-axwfwWWZcOq1FgLo1gfDRQ53EOhBRFJuIulw3hbTzb_LuTi0WyawrCqv6bPc-JNnc1EOxm0cfPubok814JAIxgi10d8oTNny_nw-xAyYbVi7POx8IdNBdqczzMv53R2sYcy0-2rid6c7bFrwL7zuYSS7bc_EBNlyxBzs9hQPpLHoffk2X5QO51rUmftB34i4LUpdk1hLNVAQ_b_GturQr46oLcklm2udz-RbPjy4jfVMTUuYEsST5OtDq1uTe1b2cA_g5vflxdRt03AuB5ZLVgcgp1cyjtUg6VJvJTMyFoSwRNjTSKJfbXEmeMX8jRJqpMHZUWBoaqnWi-EfYLMrCfQKiTayVtHmiEf7YnKuccmPxYadC33pGjOFLr4L0T9tiIx2aKTd7mOIeps0epjh70msp7cytSjmTjKOsKBnD2TCMhuKjH7pw5aqZg-6a85iO4bDV7vA7gTAvRuA0hvNelf-Ev7yWo9dNP4Z3DJ-8bc73BDbr5cqdwLb9W_-ulqcwkgt12hzlJzK36eE |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swED-NDom9wMbHKHTDSLxBJNd24oQ3tK0qoqsqWireItt1EA9Lpiblgb-ec74QYjywx8jWxfL5fD_r7n4HcCIXXFqlhIe61Z5w0UMVBcoTvh9on9pElYW085Ecj8Pb22hSF4XlTbZ7E5Isb-q22M2hDxdzdMlm3BeeWIOPAj2WY8y_ns7b2AGTZVcu13feE-ig61KZf8t46Y5eYcxX8dHS7Qy2_m_Bn2GzhpnkojoXX-CDTbdhq2nhQGqL3oG7wTL7Q36qQhE36Ji4s5QUGZlUjWZygp9DfKsuzUrb_JxckIly-VyO4vnRLkhDakKyhCCWJJdtW92CTG3RyNmFm8Gv2Y-hV_de8AyXrPBEQqliDq350qLa9EIHXGjKImH6WurQJiYJJV8wdyP4ioX9wFJhaF9TpaKQ70EnzVK7D0TpQIXSJJFC-GMSHiaUa4MPu7DvqGdEF04bFcR_K4qNuCVTLvcwxj2Myz2McXav0VJcm1secyYZR1l-1IXjdhgNxUU_VGqzVTkH3TXnAe3C10q77e8EwrwAgVMXzhpVPgt_ey0H75t-BBvD2e9RPLocXx3CJ4bP3yr_uwedYrmy32DdPBT3-fJ7eaCfAK7-690 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58IV5c367PCN60bDZJm9abqMuKsiz4wFtJ0kQ82Mpu14O_3qQvFfUgHkvCNGSSzDfMzDcAhzyhXAvBPKtb6TEXPRRRIDzm-4H0sTaiKKS9v-aDQfjwEA0_VfEX2e51SLKsaXAsTWneeUlMpyl8c0jExR9d4hn1mcemYZa5RHrnr9_cN3EEwosOXa4Hvcessa7KZn6W8dU0fcOb32KlhQnqtf6_-CVYrOAnOi3PyzJM6XQFWnVrB1Td9FV47I2yZ3QucoHcoGPozlKUZ2hYNqAZI_vZtz7sSE2kHp-gUzQULs_LUT-_6QTVZCcoM8hiTHTZtNvN0Y3OazlrcNe7uD3re1VPBk9RTnKPGYwFcSjO59qqUyYyoExiEjHVlVyG2igTcpoQ91L4goTdQGOmcFdiIaKQrsNMmqV6E5CQgQi5MpGwsEgZGhpMpbIOX9h1lDSsDUe1OuKXknojbkiWiz2M7R7GxR7GdvZOrbG4uobjmBJOqJXlR204aIbtBXJREZHqbFLMsWac0gC3YaPUdPM7ZuFfYAFVG45rtX4I_30tW3-bvg_zw_NefH05uNqGBWK94jItfAdm8tFE78Kces2fxqO94my_A4Gk9ME |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=From+Data+Completion+to+Problems+on+Hypercubes%3A+A+Parameterized+Analysis+of+the+Independent+Set+Problem&rft.jtitle=Algorithmica&rft.au=Eiben%2C+Eduard&rft.au=Ganian%2C+Robert&rft.au=Kanj%2C+Iyad&rft.au=Ordyniak%2C+Sebastian&rft.date=2026-02-01&rft.issn=0178-4617&rft.volume=88&rft.issue=1&rft_id=info:doi/10.1007%2Fs00453-025-01354-4&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon |