Deadlock models in distributed computation: foundations, design, and computational complexity. - Valmir Carneiro Barbosa; Alan Diêgo A. Carneiro; Fábio Protti; Uéverton S. Souza (SAC, 2016)

Deletion Graph Problems Based on Deadlock Resolution. - Alan Diêgo Aurélio Carneiro; Fábio Protti; Uéverton S. Souza (COCOON, 2017)

Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. - Alan Diêgo Aurélio Carneiro; Fábio Protti; Uéverton S. Souza (COCOON, 2018)

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. - Stéphane Bessy; Marin Bougeret; Alan Diêgo A. Carneiro; Fábio Protti; Uéverton S. Souza (IPEC, 2019)

Deadlock resolution in wait-for graphs by vertex/arc deletion. - Alan Diêgo Aurélio Carneiro; Fábio Protti; Uéverton S. Souza (J. Comb. Optim., 2019)

On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. - Alan Diêgo Aurélio Carneiro; Fábio Protti; Uéverton dos Santos Souza (Theor. Comput. Sci., 2022)