1.
Lu Q, Sidiropoulos ND, Konar A. Densest k-Subgraph Mining via a Provably Tight Relaxation. AAAI [Internet]. 2025 Apr. 11 [cited 2026 May 15];39(12):12291-9. Available from: https://ojs.aaai.org/index.php/AAAI/article/view/33339