Lu, Q. et al. 2025. Densest k-Subgraph Mining via a Provably Tight Relaxation. Proceedings of the AAAI Conference on Artificial Intelligence. 39, 12 (Apr. 2025), 12291–12299. DOI:https://doi.org/10.1609/aaai.v39i12.33339.