Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza. On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Theoretical Computer Science, 909:97-109, 2022. [doi]
@article{CarneiroPS22,
title = {On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem},
author = {Alan Diêgo Aurélio Carneiro and Fábio Protti and Uéverton dos Santos Souza},
year = {2022},
doi = {10.1016/j.tcs.2022.01.031},
url = {https://doi.org/10.1016/j.tcs.2022.01.031},
researchr = {https://researchr.org/publication/CarneiroPS22},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {909},
pages = {97-109},
}