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

Akanksha Agrawal et al. (2019)

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2019.35

access: open

type: Conference or Workshop Paper

metadata version: 2024-01-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics