A fast algorithm for generalized network location problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Discrete Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Complexity of domination-type problems in graphs
Nordic Journal of Computing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
On Dominating Sets and Independent Sets of Graphs
Combinatorics, Probability and Computing
A note on Nordhaus-Gaddum inequalities for domination
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Upper bounds on the k-domination number and the k-Roman domination number
Discrete Applied Mathematics
Bounds on the connected k-domination number in graphs
Discrete Applied Mathematics
The algorithmic complexity of k-domatic partition of graphs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
On k-domination and j-independence in graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
| Hi-index | 0.00 |