[1]
Q. Lu, N. D. Sidiropoulos, and A. Konar, “Densest k-Subgraph Mining via a Provably Tight Relaxation”, AAAI, vol. 39, no. 12, pp. 12291–12299, Apr. 2025.