"Parameterized Complexity of Conflict-Free Matchings and Paths."

Akanksha Agrawal et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics