Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. Parameterized Complexity of Conflict-Free Set Cover. In René van Bevern, Gregory Kucherov, editors, Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings. Volume 11532 of Lecture Notes in Computer Science, pages 191-202, Springer, 2019. [doi]
@inproceedings{JacobM019,
title = {Parameterized Complexity of Conflict-Free Set Cover},
author = {Ashwin Jacob and Diptapriyo Majumdar and Venkatesh Raman 0001},
year = {2019},
doi = {10.1007/978-3-030-19955-5_17},
url = {https://doi.org/10.1007/978-3-030-19955-5_17},
researchr = {https://researchr.org/publication/JacobM019},
cites = {0},
citedby = {0},
pages = {191-202},
booktitle = {Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings},
editor = {René van Bevern and Gregory Kucherov},
volume = {11532},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-19955-5},
}