Rafael Santos Coelho - Google Scholar

Get my own profile

Cited by

	All	Since 2019
Citations	43	37
h-index	4	4
i10-index	3	2

0

10

5

201720182019202020212022202320244 2 10 7 9 4 2 5

Co-authors

Fábio BotlerAssistant professor, Universidade de São PauloVerified email at ime.usp.br
Yoshiko WakabayashiProfessor of Computer Science, University of São PauloVerified email at ime.usp.br
Phablo F. S. MouraKU LeuvenVerified email at kuleuven.be
Orlando LeeProfessor of Computer Science, University of Campinas, BrazilVerified email at ic.unicamp.br
Maycon SambinelliAssistant Professor at Universidade Federal do ABC

Rafael Santos Coelho

Rafael Santos Coelho

Bow Valley College

Verified email at bowvalleycollege.ca

Functional Programming Categorical Programming Formal Methods Graph Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The k-hop connected dominating set problem: approximation and hardness RS Coelho, PFS Moura, Y Wakabayashi Journal of Combinatorial Optimization 34 (4), 24, 2017	11	2017
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	11	2017
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	10	2015
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	9	2020
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	2	2017

The system can't perform the operation now. Try again later.

Articles 1–5