Chamanvir Kaur, Neeldhara Misra. On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. In Manoj Changat, Sandip Das 0001, editors, Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings. Volume 12016 of Lecture Notes in Computer Science, pages 427-438, Springer, 2020. [doi]
@inproceedings{KaurM20-0,
title = {On the Parameterized Complexity of Spanning Trees with Small Vertex Covers},
author = {Chamanvir Kaur and Neeldhara Misra},
year = {2020},
doi = {10.1007/978-3-030-39219-2_34},
url = {https://doi.org/10.1007/978-3-030-39219-2_34},
researchr = {https://researchr.org/publication/KaurM20-0},
cites = {0},
citedby = {0},
pages = {427-438},
booktitle = {Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings},
editor = {Manoj Changat and Sandip Das 0001},
volume = {12016},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-39219-2},
}