NC algorithms for dominations in permutation graphs
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Program transformation for the longest upsequence set problem
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs
IEEE Transactions on Parallel and Distributed Systems
An optimal algorithm for finding biconnected components in permutation graphs
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
Efficient parallel algorithms for finding biconnected components of some intersection graphs
CSC '91 Proceedings of the 19th annual conference on Computer Science
NC coloring algorithms for permutation graphs
Nordic Journal of Computing
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Discrete Applied Mathematics
Vertex domination in dynamic networks
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An O(n)-time algorithm for the paired domination problem on permutation graphs
European Journal of Combinatorics
| Hi-index | 0.04 |