Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001. Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica, 82(7):1939-1965, 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Parameterized Complexity of Conflict-Free Matchings and PathsAkanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001. mfcs 2019: [doi] Parameterized Complexity of Conflict-Free Set CoverAshwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. csr 2019: 191-202 [doi] Parameterized Complexity of Conflict-Free Set CoverAshwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. mst, 65(3):515-540, 2021. [doi]
The following publications are possibly variants of this publication: