Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Clique-transversal sets in cubic graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Clique-transversal sets and clique-coloring in planar graphs
European Journal of Combinatorics
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |