Renato Carmo

Available identifiers

Publication	Date of Publication	Type
On the chromatic index of complementary prisms	2024-10-18	Paper
The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark	2024-06-05	Paper
Faster computing of graph square roots with girth at least six	2024-05-24	Paper
Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem	2024-05-06	Paper
A connectivity-based decomposition for graph edge-colouring	2024-04-25	Paper
An experimental analysis of exact algorithms for the maximum clique problem	2024-04-22	Paper
Maximum clique via \textsc{MaxSat} and back again	2024-04-22	Paper
Edge-colouring graphs with bounded local degree sums	2020-05-29	Paper
On comparing algorithms for the maximum clique problem	2018-09-06	Paper
Querying priced information in databases	2015-09-02	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q3044333	2004-08-11	Paper
Searching in random partially ordered sets	2004-08-10	Paper

This page was built for person: Renato Carmo