APA (7th ed.) Citation

Gözüpek, D., Özkan, S., Paul, C., Sau, I., & Shalom, M. (2017). Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theoretical computer science, 690, 91-103. https://doi.org/10.1016/j.tcs.2017.06.013

Chicago Style (17th ed.) Citation

Gözüpek, Didem, Sibel Özkan, Christophe Paul, Ignasi Sau, and Mordechai Shalom. "Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability." Theoretical Computer Science 690 (2017): 91-103. https://doi.org/10.1016/j.tcs.2017.06.013.

MLA (9th ed.) Citation

Gözüpek, Didem, et al. "Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability." Theoretical Computer Science, vol. 690, 2017, pp. 91-103, https://doi.org/10.1016/j.tcs.2017.06.013.