APA (7th ed.) Citation

Shallcross, D. F., Pan, V. Y., & Lin-Kriz, Y. (1998). Planar Integer Linear Programming is NC Equivalent to Euclidean GCD. SIAM journal on computing, 27(4), 960-971. https://doi.org/10.1137/S0097539794276841

Chicago Style (17th ed.) Citation

Shallcross, D. F., V. Y. Pan, and Y. Lin-Kriz. "Planar Integer Linear Programming Is NC Equivalent to Euclidean GCD." SIAM Journal on Computing 27, no. 4 (1998): 960-971. https://doi.org/10.1137/S0097539794276841.

MLA (9th ed.) Citation

Shallcross, D. F., et al. "Planar Integer Linear Programming Is NC Equivalent to Euclidean GCD." SIAM Journal on Computing, vol. 27, no. 4, 1998, pp. 960-971, https://doi.org/10.1137/S0097539794276841.