R. S. Coelho

Gallai's path decomposition conjecture for graphs with treewidth at most 3

Orlando Lee, Fábio Botler, Maycon Sambinelli, 2019, J. Graph Theory.

The k-hop connected dominating set problem: approximation and hardness

Phablo F. S. Moura, Yoshiko Wakabayashi, R. S. Coelho, 2017, Journal of Combinatorial Optimization.

The k-hop connected dominating set problem: approximation and hardness

Yoshiko Wakabayashi, Phablo F. S. Moura, Rafael S. Coelho, 2017, J. Comb. Optim..

The k-hop connected dominating set problem: hardness and polyhedra

Yoshiko Wakabayashi, Phablo F. S. Moura, Rafael S. Coelho, 2015, Electron. Notes Discret. Math..

The k-hop connected dominating set problem: approximation algorithms and hardness results

Rafael Santos Coelho, R. S. Coelho, 2017 .

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3 pdf

Orlando Lee, Fábio Botler, Maycon Sambinelli, 2017, ArXiv.