[1]
Konar, A. and Sidiropoulos, N.D. 2022. The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization. Proceedings of the AAAI Conference on Artificial Intelligence. 36, 4 (Jun. 2022), 4075-4082. DOI:https://doi.org/10.1609/aaai.v36i4.20325.