Renato Carmo

According to our database1, Renato Carmo authored at least 12 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The hardness of recognising poorly matchable graphs and the hunting of the <i>d</i>-snark.
RAIRO Oper. Res., 2024

2020
Edge-colouring graphs with bounded local degree sums.
Discret. Appl. Math., 2020

2018
Exact Algorithms for the Graph Coloring Problem.
RITA, 2018

On comparing algorithms for the maximum clique problem.
Discret. Appl. Math., 2018

Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs.
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.
J. Braz. Comput. Soc., 2012

Unpopular Addresses Should Not Pollute the Cache.
Proceedings of the 13th Symposium on Computer Systems, 2012

2011
Parallel Implementations of Gusfield's Cut Tree Algorithm.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010
Finding stable cliques of PlanetLab nodes.
Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, 2010

2007
Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

2004
Searching in random partially ordered sets.
Theor. Comput. Sci., 2004

Querying Priced Information in Databases: The Conjunctive Case.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004


  Loading...