Alan Diêgo A. Carneiro

According to our database, Alan Diêgo A. Carneiro authored at least 6 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

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

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

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

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

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

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Deletion Graph Problems Based on Deadlock Resolution.

Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

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

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016