Parameterized Complexity of Conflict-Free Matchings and Paths.

MLA

Agrawal, Akanksha, et al. “Parameterized Complexity of Conflict-Free Matchings and Paths.” Algorithmica, vol. 82, no. 7, July 2020, pp. 1939–65. EBSCOhost, https://doi.org/10.1007/s00453-020-00681-y.

APA

Agrawal, A., Jain, P., Kanesh, L., & Saurabh, S. (2020). Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica, 82(7), 1939–1965. https://doi.org/10.1007/s00453-020-00681-y

Chicago

Agrawal, Akanksha, Pallavi Jain, Lawqueen Kanesh, and Saket Saurabh. 2020. “Parameterized Complexity of Conflict-Free Matchings and Paths.” Algorithmica 82 (7): 1939–65. doi:10.1007/s00453-020-00681-y.