- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**In this work we present a critical analysis of various aspects associated with the specification of termination conditions for simple genetic algorithms. The study, which is based on the use of… Continue Reading

We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers k and ? such that the k th powers of the graphs are of clique-width at most… Continue Reading

A circular-arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a… Continue Reading

A normal Helly circular-arc graph is the intersection graph of arcs on a circle of which no three or less arcs cover the whole circle. Lin, Soulignac, and Szwarcfiter [Discrete Appl. Math. 2013]… Continue Reading

The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the… Continue Reading

A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we… Continue Reading

Clique-width is a graph parameter with many algorithmic applications. For a positive integer k, the k-th power of a graph G is the graph with the same vertex set as G, in which two distinct vertices… Continue Reading

Circular-arc graphs are the intersection graphs of open arcs on a circle. Circle graphs are the intersection graphs of chords on a circle. These graph classes have been the subject of much study for… Continue Reading

A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p ? 1 , all partitions of the vertex set of a bipartite… Continue Reading

An electrolytic membrane cell for the electrochemical production of an alkali metal hydrosulfite by the reduction of an alkali metal biosulfite component of a circulated aqueous catholyte solution is… Continue Reading