1999
Rearrangeable Graphs.
Inf. Process. Lett., 1999

1997
On Embedding Between 2D Meshes of the Same Size.
IEEE Trans. Computers, 1997

Topologies of Combined (2logN - 1)-Stage Interconnection Networks.
IEEE Trans. Computers, 1997

1996
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks.
IEEE Trans. Computers, 1996

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems.
J. Parallel Distributed Comput., 1996

1995
An automatic seal imprint verification approach.
Pattern Recognit., 1995

Embedding K-ary Complete Trees into Hypercubes.
J. Parallel Distributed Comput., 1995

1994
Realization of an Arbitrary Permutation on a Hypercube.
Inf. Process. Lett., 1994

Optimal Routing of Permutations on Rings.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Efficient Embedding K-ary Complete Trees into Hypercubes.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993
The 4-Star Graph is not a Subgraph of Any Hypercube.
Inf. Process. Lett., 1993

A Note on Minimal Visibility Graphs.
Inf. Process. Lett., 1993

Embedding Between 2-D Meshes of the Same Size.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1992
Approximate submatrix matching problems.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992