{"id":"https://openalex.org/W7138254821","doi":"https://doi.org/10.1609/aaai.v40i23.38984","title":"Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity","display_name":"Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138254821","doi":"https://doi.org/10.1609/aaai.v40i23.38984"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i23.38984","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.38984","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i23.38984","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129686105","display_name":"Robert Ganian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129677813","display_name":"Hung P. Hoang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung P. Hoang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024746410","display_name":"Simon Wietheger","orcid":"https://orcid.org/0000-0002-0734-0708"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon Wietheger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28839655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"23","first_page":"19108","last_page":"19116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.24040000140666962,"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":0.24040000140666962,"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.1379999965429306,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0706000030040741,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7002000212669373},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5874999761581421},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5644000172615051},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5378999710083008},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4059999883174896},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3772999942302704}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7002000212669373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6171000003814697},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5874999761581421},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5644000172615051},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5378999710083008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5325999855995178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4643999934196472},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40070000290870667},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.35589998960494995},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.2996000051498413},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i23.38984","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.38984","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i23.38984","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.38984","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,78],"study":[1],"the":[2,41,44,47,57,88,108],"computational":[3],"problem":[4,48,109],"of":[5,11,87,98],"computing":[6],"a":[7,21,53,83],"fair":[8,45,74],"means":[9,75,97],"clustering":[10,76],"discrete":[12],"vectors,":[13],"which":[14,94],"admits":[15],"an":[16,67,115],"equivalent":[17],"formulation":[18],"as":[19],"editing":[20],"colored":[22],"matrix":[23],"into":[24],"one":[25],"with":[26],"few":[27],"distinct":[28],"color-balanced":[29],"rows":[30],"by":[31],"changing":[32],"at":[33],"most":[34],"k":[35],"values.":[36],"While":[37],"NP-hard":[38],"in":[39,56],"both":[40],"fairness-oblivious":[42],"and":[43,90],"settings,":[46],"is":[49],"well-known":[50],"to":[51,81],"admit":[52],"fixed-parameter":[54,111],"algorithm":[55,69],"former":[58],"\"vanilla\"":[59],"setting.":[60],"As":[61],"our":[62,100],"first":[63],"contribution,":[64],"we":[65],"exclude":[66],"analogous":[68],"even":[70],"for":[71],"highly":[72],"restricted":[73],"instances.":[77],"then":[79],"proceed":[80],"obtain":[82],"full":[84],"complexity":[85],"landscape":[86],"problem,":[89],"establish":[91],"tractability":[92],"results":[93],"capture":[95],"three":[96],"circumventing":[99],"obtained":[101],"lower":[102],"bound:":[103],"placing":[104],"additional":[105],"constraints":[106],"on":[107],"instances,":[110],"approximation,":[112],"or":[113],"using":[114],"alternative":[116],"parameterization":[117],"targeting":[118],"tree-like":[119],"matrices.":[120]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-03-18T00:00:00"}