An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Efficient Minus and Signed Domination in Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Efficient minus and signed domination in graphs
Theoretical Computer Science
Counting the number of vertex covers in a trapezoid graph
Information Processing Letters
Efficient edge domination on hole-free graphs in polynomial time
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Self-stabilizing algorithms for efficient sets of graphs and trees
Information Processing Letters
| Hi-index | 0.00 |