Liu, Y. et al. 2026. A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds. Proceedings of the AAAI Conference on Artificial Intelligence. 40, 18 (Mar. 2026), 15360–15368. DOI:https://doi.org/10.1609/aaai.v40i18.38562.