Követés
Rafael Santos Coelho
Rafael Santos Coelho
Instructor at Robertson College
E-mail megerősítve itt: robertsonglobal.ca
Cím
Hivatkozott rá
Hivatkozott rá
Év
The k-hop connected dominating set problem: approximation and hardness
RS Coelho, PFS Moura, Y Wakabayashi
Journal of Combinatorial Optimization 34 (4), 24, 2017
112017
On Gallai's and Hajós' conjectures for graphs with treewidth at most 3
F Botler, M Sambinelli, RS Coelho, O Lee
arXiv preprint arXiv:1706.04334, 2017
102017
The k-hop connected dominating set problem: hardness and polyhedra
RS Coelho, PFS Moura, Y Wakabayashi
Electronic Notes in Discrete Mathematics 50, 59-64, 2015
102015
Gallai's path decomposition conjecture for graphs with treewidth at most 3
F Botler, M Sambinelli, RS Coelho, O Lee
Journal of Graph Theory 93 (3), 328-349, 2020
82020
On a joint technique for Hajos’ and Gallai’s conjectures
F Botler, M Sambinelli, RS Coelho, O Lee
2º ETC (Encontro de Teoria da Computação)/XXXVII Congresso da Sociedade …, 2017
22017
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–5