On domination problems for permutation and other graphs
Theoretical Computer Science
Finding a minimum independent dominating set in a permutation graph
Discrete Applied Mathematics
Fast algorithms for the dominating set problem on permutation graphs
SIGAL '90 Proceedings of the international symposium on Algorithms
A new approach for the domination problem on permutation graphs
Information Processing Letters
Why should biconnected components be identified first
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
Information Processing Letters
An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph
SIAM Journal on Computing
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
| Hi-index | 0.00 |