APA (7th ed.) Citation

Smeulders, B., Blom, D. A. M. P., & Spieksma, F. C. R. (2024). Identifying optimal strategies in kidney exchange games is Σ2p-complete. Mathematical Programming, 203(1/2), 347. https://doi.org/10.1007/s10107-021-01748-6

Chicago Style (17th ed.) Citation

Smeulders, B., D. A. M. P. Blom, and F. C. R. Spieksma. "Identifying Optimal Strategies in Kidney Exchange Games Is Σ2p-complete." Mathematical Programming 203, no. 1/2 (2024): 347. https://doi.org/10.1007/s10107-021-01748-6.

MLA (9th ed.) Citation

Smeulders, B., et al. "Identifying Optimal Strategies in Kidney Exchange Games Is Σ2p-complete." Mathematical Programming, vol. 203, no. 1/2, 2024, p. 347, https://doi.org/10.1007/s10107-021-01748-6.