Tu, S., Stankovic, A., Neumann, S., & Gionis, A. (2025). Optirefine: densest subgraphs and maximum cuts with k refinements. Data Mining and Knowledge Discovery, 39(6). https://doi.org/10.1007/s10618-025-01142-2
ISO-690 (author-date, English)TU, Sijing, STANKOVIC, Aleksa, NEUMANN, Stefan and GIONIS, Aristides, 2025. Optirefine: densest subgraphs and maximum cuts with k refinements. Data Mining and Knowledge Discovery. 1 November 2025. Vol. 39, no. 6, . DOI 10.1007/s10618-025-01142-2.
Modern Language Association 9th editionTu, S., A. Stankovic, S. Neumann, and A. Gionis. “Optirefine: Densest Subgraphs and Maximum Cuts With K Refinements”. Data Mining and Knowledge Discovery, vol. 39, no. 6, Nov. 2025, https://doi.org/10.1007/s10618-025-01142-2.
Mohr Siebeck - Recht (Deutsch - Österreich)Tu, Sijing/Stankovic, Aleksa/Neumann, Stefan/Gionis, Aristides: Optirefine: densest subgraphs and maximum cuts with k refinements, Data Mining and Knowledge Discovery 2025,
Emerald - HarvardTu, S., Stankovic, A., Neumann, S. and Gionis, A. (2025), “Optirefine: densest subgraphs and maximum cuts with k refinements”, Data Mining and Knowledge Discovery, Vol. 39 No. 6, available at:https://doi.org/10.1007/s10618-025-01142-2.