{"id":"https://openalex.org/W1994262057","doi":"https://doi.org/10.1093/comjnl/bxm086","title":"Parameterized Complexity of Cardinality Constrained Optimization Problems","display_name":"Parameterized Complexity of Cardinality Constrained Optimization Problems","publication_year":2007,"publication_date":"2007-03-06","ids":{"openalex":"https://openalex.org/W1994262057","doi":"https://doi.org/10.1093/comjnl/bxm086","mag":"1994262057"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxm086","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm086","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086746405","display_name":"Lilong Cai","orcid":"https://orcid.org/0000-0002-8034-9645"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"L. Cai","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong SAR, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086746405"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":1.1046,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.77108138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"51","issue":"1","first_page":"102","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9261074066162109},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7666222453117371},{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.7302958965301514},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5726562738418579},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5724331140518188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4918675422668457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46159788966178894},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4296242594718933},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4258645176887512},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36617839336395264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3261064887046814}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9261074066162109},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7666222453117371},{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.7302958965301514},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5726562738418579},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5724331140518188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4918675422668457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46159788966178894},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4296242594718933},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4258645176887512},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36617839336395264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3261064887046814},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxm086","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm086","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.7121","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/cgi/reprint/bxm086v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1479863711","https://openalex.org/W1519147138","https://openalex.org/W1559081432","https://openalex.org/W1566493102","https://openalex.org/W1570425181","https://openalex.org/W1979740015","https://openalex.org/W2003813631","https://openalex.org/W2011039300","https://openalex.org/W2027038333","https://openalex.org/W2034543148","https://openalex.org/W2051856222","https://openalex.org/W2061513598","https://openalex.org/W2115659887","https://openalex.org/W2121641644","https://openalex.org/W2129939288","https://openalex.org/W2296148711","https://openalex.org/W2340006107","https://openalex.org/W2618199688","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W1994262057","https://openalex.org/W2064551423","https://openalex.org/W2899153523","https://openalex.org/W2947894078","https://openalex.org/W3204965069","https://openalex.org/W2807131660","https://openalex.org/W2370949144","https://openalex.org/W3037021436","https://openalex.org/W1988027774","https://openalex.org/W4312778024"],"abstract_inverted_index":{"We":[0,55],"study":[1],"the":[2],"parameterized":[3,61],"complexity":[4,62],"of":[5,21,88],"cardinality":[6,79],"constrained":[7,80],"optimization":[8,11,35,81],"problems,":[9,36],"i.e.":[10],"problems":[12,82,87],"that":[13,43],"require":[14],"their":[15,40,60],"solutions":[16],"to":[17,23],"contain":[18],"specified":[19],"numbers":[20],"elements":[22],"optimize":[24],"solution":[25],"values.":[26],"For":[27],"this":[28],"purpose,":[29],"we":[30,72],"consider":[31],"around":[32],"20":[33],"such":[34],"as":[37,39],"well":[38],"parametric":[41],"duals,":[42],"deal":[44],"with":[45],"various":[46],"fundamental":[47],"relations":[48],"among":[49],"vertices":[50],"and":[51],"edges":[52],"in":[53,94],"graphs.":[54,96],"have":[56],"almost":[57],"completely":[58],"settled":[59],"by":[63,83],"giving":[64],"either":[65],"FPT":[66],"algorithms":[67,76],"or":[68],"W[1]-hardness":[69],"proofs.":[70],"Furthermore,":[71],"obtain":[73],"faster":[74],"exact":[75],"for":[77],"several":[78],"transforming":[84],"them":[85],"into":[86],"finding":[89],"maximum":[90],"(minimum)":[91],"weight":[92],"triangles":[93],"weighted":[95]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":5}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}