Parameterized Complexity of Conflict-Free Set Cover - Research

Home > Computer Science home > Research > Profile > Publications > Parameterized Complexity of Conflict-Free Set Cover

Parameterized Complexity of Conflict-Free Set Cover. / Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh.

Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. ed. / Gregory Kucherov; René van Bevern. Vol. 11532 LNCS Springer-Verlag, 2019. p. 191-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11532 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Published

Documents

Accepted Manuscript
Accepted author manuscript, 365 KB, PDF-document

Ashwin Jacob
Diptapriyo Majumdar
Venkatesh Raman

Department of Computer Science

Original language	English
Title of host publication	Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
Editors	Gregory Kucherov, René van Bevern
Publisher	Springer-Verlag
Pages	191-202
Number of pages	12
Volume	11532 LNCS
ISBN (Electronic)	978-3-030-19955-5
ISBN (Print)	978-3-030-19954-8
DOIs	https://doi.org/10.1007/978-3-030-19955-5_17
Publication status	Published - 1 Jul 2019
Event	14th International Computer Science Symposium in Russia, CSR 2019 - Novosibirsk, Russian Federation Duration: 1 Jul 2019 → 5 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11532 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349