We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at lea...

Let be a fixed collection of digraphs. Given a digraph H, a -packing of H is a collection of vertex disjoint subgraphs of H, each isomorphic to a mem...

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for t...

We show a new algorithm for computing in O(n) time a floor-plan of a given plane near-triangulation. We use modules which are the union of two rectang...

We present an optimal O(n) time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane and prove that calculating the opti...