Querying Priced Information in Databases: The Conjunctive Case. - Eduardo Sany Laber; Renato Carmo; Yoshiharu Kohayakawa (LATIN, 2004)

Searching in random partially ordered sets. - Renato Carmo; Jair Donadelli; Yoshiharu Kohayakawa; Eduardo Sany Laber (Theor. Comput. Sci., 2004)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

Finding stable cliques of PlanetLab nodes. - Elias P. Duarte Jr.; Thiago Garrett; Luis C. E. Bona; Renato Carmo; Alexandre Prusch Züge (DSN, 2010)

Parallel Implementations of Gusfield's Cut Tree Algorithm. - Jaime Cohen; Luiz A. Rodrigues; Fabiano Silva; Renato Carmo; André Luiz Pires Guedes; Elias P. Duarte Jr. (ICA3PP (1), 2011)

Unpopular Addresses Should Not Pollute the Cache. - Renato Carmo; Roberto A. Hexsel (WSCAD-SSC, 2012)

Branch and bound algorithms for the maximum clique problem under a unified framework. - Renato Carmo; Alexandre Prusch Züge (J. Braz. Comput. Soc., 2012)

Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs. - Leandro M. Zatesko; Renato Carmo; André Luiz Pires Guedes (ICORES, 2018)

On comparing algorithms for the maximum clique problem. - Alexandre Prusch Züge; Renato Carmo (Discret. Appl. Math., 2018)

Exact Algorithms for the Graph Coloring Problem. - Alane Marie de Lima; Renato Carmo (RITA, 2018)

Edge-colouring graphs with bounded local degree sums. - Leandro M. Zatesko; Alesom Zorzi; Renato Carmo; André Luiz Pires Guedes (Discret. Appl. Math., 2020)

The hardness of recognising poorly matchable graphs and the hunting of the d-snark. - Leandro M. Zatesko; Renato Carmo; André Luiz Pires Guedes; Raphael C. S. Machado; Celina M. H. de Figueiredo (RAIRO Oper. Res., 2024)