American Psychological Association 6th edition

Chandrasekaran, K., Xu, C., & Yu, X. (2021). Hypergraph k-cut in randomized polynomial time. Mathematical Programming: A Publication of the Mathematical Optimization Society, 186(1-2), 85-113. https://doi.org/10.1007/s10107-019-01443-7

ISO-690 (author-date, English)

CHANDRASEKARAN, Karthekeyan, XU, Chao and YU, Xilin, 2021. Hypergraph k-cut in randomized polynomial time. Mathematical Programming: A Publication of the Mathematical Optimization Society. 1 March 2021. Vol. 186, no. 1-2, p. 85-113. DOI 10.1007/s10107-019-01443-7.

Modern Language Association 9th edition

Chandrasekaran, K., C. Xu, and X. Yu. “Hypergraph K-Cut in Randomized Polynomial Time”. Mathematical Programming: A Publication of the Mathematical Optimization Society, vol. 186, no. 1-2, Mar. 2021, pp. 85-113, https://doi.org/10.1007/s10107-019-01443-7.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chandrasekaran, Karthekeyan/Xu, Chao/Yu, Xilin: Hypergraph k-cut in randomized polynomial time, Mathematical Programming: A Publication of the Mathematical Optimization Society 2021, 85-113.

Emerald - Harvard

Chandrasekaran, K., Xu, C. and Yu, X. (2021), “Hypergraph k-cut in randomized polynomial time”, Mathematical Programming: A Publication of the Mathematical Optimization Society, Vol. 186 No. 1-2, pp. 85-113.

Warning: These citations may not always be 100% accurate.