APA (7th ed.) Citation

Henning, S., Jansen, K., Rau, M., Schmarje, L., Hutchison, D., Kanade, T., . . . Podolskii, V. V. (2018). Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings, 10846, 169. https://doi.org/10.1007/978-3-319-90530-3_15

Chicago Style (17th ed.) Citation

Henning, Sören, et al. "Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing." Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings 10846 (2018): 169. https://doi.org/10.1007/978-3-319-90530-3_15.

MLA (9th ed.) Citation

Henning, Sören, et al. "Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing." Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings, vol. 10846, 2018, p. 169, https://doi.org/10.1007/978-3-319-90530-3_15.