关注
Alan Diêgo Aurélio Carneiro
Alan Diêgo Aurélio Carneiro
Estudante de Doutorado, Universidade Federal Fluminense
在 ic.uff.br 的电子邮件经过验证
标题
引用次数
引用次数
年份
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
142019
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
142016
Deletion graph problems based on deadlock resolution
ADA Carneiro, F Protti, US Souza
International Computing and Combinatorics Conference, 75-86, 2017
82017
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
32019
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem
ADA Carneiro, F Protti, U dos Santos Souza
Theoretical Computer Science 909, 97-109, 2022
22022
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
22018
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
12015
14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
BA Berendsohn, L Kozma, D Marx, S Bessy, M Bougeret, ADA Carneiro, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 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
Check for updates Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion A Deadlock Resolution Graph Problem
ADA Carneiro, F Protti, US Souza
Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 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
On the Knot-Free Vertex Deletion Problem: A Parameterized Complexity Analysis
ADA Carneiro
And/Or-Convexity: A Graph Convexity Based on Processes And Deadlock Models
ADA Carneiro
系统目前无法执行此操作,请稍后再试。
文章 1–14