On the complexity of singly connected vertex deletion - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Avinandan Das' in GoogleThis author has not been identified. Look up 'Lawqueen Kanesh' in GoogleThis author has not been identified. Look up 'Jayakrishnan Madathil' in GoogleThis author has not been identified. Look up 'Komal Muluk' in GoogleThis author has not been identified. Look up 'Nidhi Purohit' in GoogleThis author has not been identified. Look up 'Saket Saurabh 0001' in Google

runs on WebDSL