Renato Carmo

From MaRDI portal
Revision as of 10:23, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Renato Carmo to Renato Carmo: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1671300

Available identifiers

zbMath Open carmo.renatoMaRDI QIDQ1671300

List of research outcomes





PublicationDate of PublicationType
On the chromatic index of complementary prisms2024-10-18Paper
The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark2024-06-05Paper
Faster computing of graph square roots with girth at least six2024-05-24Paper
Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem2024-05-06Paper
A connectivity-based decomposition for graph edge-colouring2024-04-25Paper
An experimental analysis of exact algorithms for the maximum clique problem2024-04-22Paper
Maximum clique via \textsc{MaxSat} and back again2024-04-22Paper
Edge-colouring graphs with bounded local degree sums2020-05-29Paper
On comparing algorithms for the maximum clique problem2018-09-06Paper
Querying priced information in databases2015-09-02Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q30443332004-08-11Paper
Searching in random partially ordered sets2004-08-10Paper

Research outcomes over time

This page was built for person: Renato Carmo

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1671300&oldid=10885909"
Powered by MediaWiki