Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

Ganian, Robert; Hoang, Hung P.; Wietheger, Simon

doi:10.1609/AAAI.V40I23.38984

by Robert Ganian, Hung P. Hoang, Simon Wietheger

Reference:

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and ComplexityRobert Ganian, Hung P. Hoang, Simon WiethegerFortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press.

Bibtex Entry:

@inproceedings{GanianHungWietheger26,
	author       = {Robert Ganian and
                  Hung P. Hoang and
                  Simon Wietheger},
  editor       = {Sven Koenig and
                  Chad Jenkins and
                  Matthew E. Taylor},
  title        = {Matrix Editing Meets Fair Clustering: Parameterized Algorithms and
                  Complexity},
  booktitle    = {Fortieth {AAAI} Conference on Artificial Intelligence, Thirty-Eighth
                  Conference on Innovative Applications of Artificial Intelligence,
                  Sixteenth Symposium on Educational Advances in Artificial Intelligence,
                  {AAAI} 2026, Singapore, January 20-27, 2026},
  pages        = {19108--19116},
  publisher    = {{AAAI} Press},
  year         = {2026},
  url          = {https://doi.org/10.1609/aaai.v40i23.38984},
  doi          = {10.1609/AAAI.V40I23.38984},
  keywords = {ParAI,COE}
}