Edge coloring, total coloring and L(2,1)-labeling are well-studied NP-hard graph problems. Even the versions asking whether a graph has a coloring with few colors or a labeling with few labels remain… (More)

The number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159. This upper bound might not be tight, since no examples of graphs with 1.5705 or more minimal… (More)

A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph.… (More)

2014 International Conference on High Performance…

2014

Nowadays, Cloud offers many interesting features such as on-demand and pay-as-you-go resources, but induces new security problems in case a company wants to outsource its critical services. But since… (More)

A feedback vertex set in a graph is a set of vertices whose removal leaves the remaining graph acyclic. Given the vast number of published results concerning feedback vertex sets, it is surprising… (More)

We investigate a domination-like problem from the exact exponential algorithms viewpoint. The classical Dominating Set problem ranges among one of the most famous and studied NP -complete covering… (More)

The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The List k-Coloring problem requires in addition… (More)