A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
On the dominating set polytope
European Journal of Combinatorics
On the mixed domination problem in graphs
Theoretical Computer Science
Algorithmic aspects of the k-domination problem in graphs
Discrete Applied Mathematics
Some advances on the set covering polyhedron of circulant matrices
Discrete Applied Mathematics
| Hi-index | 0.05 |