The following pages link to Renato Carmo (Q1671300):
Displaying 14 items.
- (Q596138) (redirect page) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Querying priced information in databases (Q2944545) (← links)
- (Q3044333) (← links)
- LATIN 2004: Theoretical Informatics (Q5901621) (← links)
- An experimental analysis of exact algorithms for the maximum clique problem (Q6489457) (← links)
- Maximum clique via \textsc{MaxSat} and back again (Q6489458) (← links)
- A connectivity-based decomposition for graph edge-colouring (Q6492333) (← links)
- Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem (Q6496817) (← links)
- Faster computing of graph square roots with girth at least six (Q6543679) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- On the chromatic index of complementary prisms (Q6621267) (← links)
