APA (7th ed.) Citation

Saurabh, S., & Zehavi, M. (2018). (k,n-k)-Max-Cut: An O∗(2p)-Time Algorithm and a Polynomial Kernel. Algorithmica, 80(12), 3844-3860. https://doi.org/10.1007/s00453-018-0418-5

Chicago Style (17th ed.) Citation

Saurabh, Saket, and Meirav Zehavi. "(k,n-k)-Max-Cut: An O∗(2p)-Time Algorithm and a Polynomial Kernel." Algorithmica 80, no. 12 (2018): 3844-3860. https://doi.org/10.1007/s00453-018-0418-5.

MLA (9th ed.) Citation

Saurabh, Saket, and Meirav Zehavi. "(k,n-k)-Max-Cut: An O∗(2p)-Time Algorithm and a Polynomial Kernel." Algorithmica, vol. 80, no. 12, 2018, pp. 3844-3860, https://doi.org/10.1007/s00453-018-0418-5.