Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On the Complexity of Singly Connected Vertex DeletionAvinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001. iwoca 2020: 237-250 [doi]
The following publications are possibly variants of this publication: