Renato Carmo

According to our database, Renato Carmo authored at least 11 papers between 2004 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Edge-colouring graphs with bounded local degree sums.

Leandro M. Zatesko, Alesom Zorzi, Renato Carmo, André Luiz Pires Guedes

Discret. Appl. Math., 2020

2018

Exact Algorithms for the Graph Coloring Problem.

Alane Marie de Lima, Renato Carmo

RITA, 2018

On comparing algorithms for the maximum clique problem.

Alexandre Prusch Züge, Renato Carmo

Discret. Appl. Math., 2018

Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs.

Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

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

Unpopular Addresses Should Not Pollute the Cache.

Renato Carmo, Roberto A. Hexsel

Proceedings of the 13th Symposium on Computer Systems, 2012

2011

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.

Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010

Finding stable cliques of PlanetLab nodes.

Elias P. Duarte Jr., Thiago Garrett, Luis C. E. Bona, Renato Carmo, Alexandre Prusch Züge

Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, 2010

2007

Querying priced information in databases: The conjunctive case.

Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas

ACM Trans. Algorithms, 2007

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.

Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa

Proceedings of the LATIN 2004: Theoretical Informatics, 2004