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]
No references recorded for this publication.
No citations of this publication recorded.