| Deadlock models in distributed computation: foundations, design, and computational complexity VC Barbosa, ADA Carneiro, F Protti, US Souza Proceedings of the 31st annual ACM symposium on applied computing, 538-541, 2016 | 8 | 2016 |
| Deletion graph problems based on deadlock resolution ADA Carneiro, F Protti, US Souza International Computing and Combinatorics Conference, 75-86, 2017 | 4 | 2017 |
| Deadlock resolution in wait-for graphs by vertex/arc deletion ADA Carneiro, F Protti, US Souza Journal of Combinatorial Optimization 37 (2), 546-562, 2019 | 3 | 2019 |
| Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion–A Deadlock Resolution Graph Problem ADA Carneiro, F Protti, US Souza International Computing and Combinatorics Conference, 84-95, 2018 | 1 | 2018 |
| Complexidade de resolução de deadlocks em grafos de espera de sistemas distribuídos ADA Carneiro, F Protti, U dos Santos Souza XLVII Simpósio Brasileiro de Pesquisa Operacional, 2015 | 1 | 2015 |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs S Bessy, M Bougeret, ADA Carneiro, F Protti, US Souza arXiv preprint arXiv:1910.01783, 2019 | | 2019 |
| Complexidade Parametrizada de Cliques e Conjuntos Independentes em Grafos Prismas Complementares P Camargo, ADA Carneiro, US Santos Anais do III Encontro de Teoria da Computação, 2018 | | 2018 |
| Resolução de Deadlocks: Complexidade e Tratabilidade Parametrizada ADA Carneiro, F Protti, U dos Santos Souza | | 2017 |
| Sobre Deadlocks e sua Resolução: dos Modelos de Grafos de Espera à Complexidade Computacional ADA Carneiro Universiade Federal Fluminense, 2016 | | 2016 |
| And/Or-Convexity: A Graph Convexity Based on Processes And Deadlock Models ADA Carneiro | | |
Ueverton SouzaFluminense Federal UniversityE-mail confirmado em ic.uff.br
