@InProceedings{agrawal_et_al:LIPIcs.MFCS.2019.35,
author = {Agrawal, Akanksha and Jain, Pallavi and Kanesh, Lawqueen and Saurabh, Saket},
title = {{Parameterized Complexity of Conflict-Free Matchings and Paths}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.35},
URN = {urn:nbn:de:0030-drops-109798},
doi = {10.4230/LIPIcs.MFCS.2019.35},
annote = {Keywords: Conflict-free, Matching, Shortest Path, FPT algorithm, W\lbrack1\rbrack-hard, Matroid}
}