Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001. On the complexity of singly connected vertex deletion. Theoretical Computer Science, 934:47-64, 2022. [doi]
@article{DasKMMPS22,
title = {On the complexity of singly connected vertex deletion},
author = {Avinandan Das and Lawqueen Kanesh and Jayakrishnan Madathil and Komal Muluk and Nidhi Purohit and Saket Saurabh 0001},
year = {2022},
doi = {10.1016/j.tcs.2022.08.012},
url = {https://doi.org/10.1016/j.tcs.2022.08.012},
researchr = {https://researchr.org/publication/DasKMMPS22},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {934},
pages = {47-64},
}